Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear system”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,333 records · Page 74
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Data-driven modeling and control of an X-ray bimorph adaptive mirror

Adaptive X-ray mirrors are being adopted on high-coherent-flux synchrotron and X-ray free-electron laser beamlines where dynamic phase control and aberration compensation are necessary to preserve wavefront quality from source to sample, yet challenging to achieve. Additional difficulties arise from the inability to continuously probe the wavefront in this context, which demands methods of control that require little to no feedback. In this work, a data-driven approach to the control of adaptive X-ray optics with piezo-bimorph actuators is demonstrated. This approach approximates the non-linear system dynamics with a discrete-time model using random mirror shapes and interferometric measurements as training data. For mirrors of this type, prior states and voltage inputs affect the shape-change trajectory, and therefore must be included in the model. Without the need for assumed physical models of the mirror's behavior, the generality of the neural network structure accommodates drift, creep and hysteresis, and enables a control algorithm that achieves shape control and stability below 2 nm RMS. Using a prototype mirror and ex situ metrology, it is shown that the accuracy of our trained model enables open-loop shape control across a diverse set of states and that the control algorithm achieves shape error magnitudes that fall within diffraction-limited performance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2012

Modeling the Performance of an Algebraic Multigrid Cycle Using Hybrid MPI/OpenMP

The rise of multicore cluster architectures has led to intense interest in using a combination of MPI and OpenMP to more effectively program these machines. We present a performance model for hybrid implementation of the solve cycle of algebraic multigrid (AMG), a popular iterative solver for large sparse linear systems and a key component of many scientific simulations. We validate the model on two leading parallel platforms, and discuss implications for applications programmed in a hybrid model on future machines.

Gahvari, Hormozd↗
DOE OSTI2023

AMG Preconditioners based on parallel hybrid coarsening and multi-objective graph matching

We describe preliminary results from a multi-objective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on high-end parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package \texttt{PSCToolkit} to exploit multi-threaded parallelism at the node level on multi-core processors. Our matching proposal balances the need to simultaneously compute high weights and large cardinalities by a new formulation of the weighted matching problem combining both these objectives using a parameter $\lambda$. We compute the matching by a parallel $2/3-\varepsilon$-approximation algorithm for maximum weight matchings. Results with the new matching algorithm show that for a suitable choice of the parameter $\lambda$ we compute effective preconditioners in the presence of anisotropy, i.e., smaller solve times, setup times, iterations counts, and operator complexity.

D'Ambra, Pasqua↗
DOE OSTI2025

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗
DOE OSTI2022

Advanced Quantum Poisson Solver in the NISQ era

The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far, either suffer from lack of accuracy and/or are limited to very small sizes of the problem, and thus have no practical usage. Here we present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. After converting the Poisson equation to the linear systems through the finite difference method, we adopt the Harrow-Hassidim-Lloyd (HHL) algorithm as the basic framework. Particularly, in this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues through eigenvalue amplification as well as by increasing the accuracy of the controlled rotation angular coefficients, which are the critical factors in the HHL algorithm. We show that our algorithm not only increases the accuracy of the solutions, but also composes more practical and scalable circuits by dynamically controlling problem size in the NISQ devices. We present both simulated and experimental results, and discuss the sources of errors. Finally, we conclude that overall results on the quantum hardware are dominated by the error in the CNOT gates.

Robson, Walter↗
DOE OSTI2017

Efficient Scalable Parallel Higher Order Direct MoM-SIE Method With Hierarchically Semiseparable Structures for 3-D Scattering

A novel fast scalable parallel algorithm is proposed for the solution of large 3-D scattering problems based on: 1) the double (geometrical and current-approximation) higher order (DHO) method of moments (MoM) in the surface integral equation (SIE) formulation and 2) a direct solver for dense linear systems utilizing hierarchically semiseparable (HSS) structures. Namely, an HSS matrix representation is used for compression, factorization, and solution of the system matrix. In addition, a rank-revealing QR decomposition for memory compression is used, with a stopping criterion in terms of the relative rank tolerance value. One method for geometrical preprocessing of the scatterers based on the cobblestone distance sorting technique is employed in order to enhance the HSS algorithm accuracy and parallelization. Numerical examples show how the accuracy of the DHO HSS-MoM-SIE method is easily controllable by using the relative tolerance for the matrix compression. Furthermore, the examples demonstrate low memory consumption, as well as much faster simulation time, when compared to the direct LU decomposition. The method enables dramatically faster monostatic scattering computations than iterative solvers and reduced number of unknowns when compared to low-order discretizations. Finally, great scalability of the algorithm is demonstrated on more than one thousand processes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Estimation of the Dynamic States of Synchronous Machines Using an Extended Particle Filter

In this paper, an extended particle filter (PF) is proposed to estimate the dynamic states of a synchronous machine using phasor measurement unit (PMU) data. A PF propagates the mean and covariance of states via Monte Carlo simulation, is easy to implement, and can be directly applied to a non-linear system with non-Gaussian noise. The extended PF modifies a basic PF to improve robustness. Using Monte Carlo simulations with practical noise and model uncertainty considerations, the extended PF’s performance is evaluated and compared with the basic PF and an extended Kalman filter (EKF). The extended PF results showed high accuracy and robustness against measurement and model noise.

particle filter, phasor measurement unit (PMU), st↗
DOE OSTI2013

The effect of averaging adjacent planes for artifact reduction in matrix inversion tomosynthesis

Purpose: Matrix inversion tomosynthesis (MITS) uses linear systems theory and knowledge of the imaging geometry to remove tomographic blur that is present in conventional backprojection tomosynthesis reconstructions, leaving in-plane detail rendered clearly. The use of partial-pixel interpolation during the backprojection process introduces imprecision in the MITS modeling of tomographic blur, and creates low-contrast artifacts in some MITS planes. This paper examines the use of MITS slabs, created by averaging several adjacent MITS planes, as a method for suppressing partial-pixel artifacts. Methods: Human chest tomosynthesis projection data, acquired as part of an IRB-approved pilot study, were used to generate MITS planes, three-plane MITS slabs (MITSa3), five-plane MITS slabs (MITSa5), and seven-plane MITS slabs (MITSa7). These were qualitatively examined for partial-pixel artifacts and the visibility of normal and abnormal anatomy. Additionally, small (5 mm) subtle pulmonary nodules were simulated and digitally superimposed upon human chest tomosynthesis projection images, and their visibility was qualitatively assessed in the different reconstruction techniques. Simulated images of a thin wire were used to generate modulation transfer function (MTF) and slice-sensitivity profile curves for the different MITS and MITS slab techniques, and these were examined for indications of partial-pixel artifacts and frequency response uniformity. Finally, mean-subtracted, exposure-normalized noise power spectra (ENNPS) estimates were computed and compared for MITS and MITS slab reconstructions, generated from 10 sets of tomosynthesis projection data of an acrylic slab. The simulated in-plane MTF response of each technique was also combined with the square root of the ENNPS estimate to yield stochastic signal-to-noise ratio (SNR) information about the different reconstruction techniques. Results: For scan angles of 20 Degree-Sign and 5 mm plane separation, seven MITS planes must be averaged to sufficiently remove partial-pixel artifacts. MITSa7 does appear to subtly reduce the contrast of high-frequency 'edge' information, but the removal of partial-pixel artifacts makes the appearance of low-contrast, fine-detail anatomy even more conspicuous in MITSa7 slices. MITSa7 also appears to render simulated subtle 5 mm pulmonary nodules with greater visibility than MITS alone, in both the open lung and regions overlying the mediastinum. Finally, the MITSa7 technique reduces stochastic image variance, though the in-plane stochastic SNR (for very thin objects which do not span multiple MITS planes) is only improved at spatial frequencies between 0.05 and 0.20 cycles/mm. Conclusions: The MITSa7 method is an improvement over traditional single-plane MITS for thoracic imaging and the pulmonary nodule detection task, and thus the authors plan to use the MITSa7 approach for all future MITS research at the authors' institution.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Investigating ion recombination effects in a liquid-filled ionization chamber array used for IMRT QA measurements

Purpose: PTW’s Octavius 1000 SRS array performs IMRT quality assurance (QA) measurements with liquid-filled ionization chambers (LICs) to allow closer detector spacing and higher resolution, compared to air-filled QA devices. However, reduced ion mobility in LICs relative to air leads to increased ion recombination effects and reduced collection efficiencies that are dependent on Linac pulse frequency and pulse dose. These pulse parameters are variable during an IMRT delivery, which affects QA results. In this study, (1) 1000 SRS collection efficiencies were measured as a function of pulse frequency and pulse dose, (2) two methods were developed to correct changes in collection efficiencies during IMRT QA measurements, and the effects of these corrections on QA pass rates were compared. Methods: To obtain collection efficiencies, the OCTAVIUS 1000 SRS was used to measure open fields of varying pulse frequency, pulse dose, and beam energy with results normalized to air-filled chamber measurements. Changes in ratios of 1000 SRS to chamber measured dose were attributed to changing collection efficiencies, which were then correlated to pulse parameters using regression analysis. The usefulness of the derived corrections was then evaluated using 6 MV and 10FFF SBRT RapidArc plans delivered to the OCTAVIUS 4D system using a TrueBeam (Varian Medical Systems) linear accelerator equipped with a high definition multileaf collimator. For the first correction, MATLAB software was developed that calculates pulse frequency and pulse dose for each detector, using measurement and DICOM RT Plan files. Pulse information is converted to collection efficiency, and measurements are corrected by multiplying detector dose by ratios of calibration to measured collection efficiencies. For the second correction the MU/min in the daily 1000 SRS calibration was chosen to match the average MU/min of the volumetric modulated arc therapy plan. Effects of the two corrections on QA results were examined by performing 3D gamma analysis comparing predicted to measured dose, with and without corrections. Results: Collection efficiencies correlated linearly to pulse dose, while correlations with pulse frequency were less defined, generally increasing as pulse frequency decreased. After complex MATLAB corrections, average 3D gamma pass rates improved by [0.07%,0.40%,1.17%] for 6 MV and [0.29%,1.40%,4.57%] for 10FFF using [3%/3 mm,2%/2 mm,1%/1 mm] criteria. Maximum changes in gamma pass rates were [0.43%,1.63%,3.05%] for 6 MV and [1.00%,4.80%,11.2%] for 10FFF using [3%/3 mm,2%/2 mm,1%/1 mm] criteria. On average, pass rates of simple daily calibration corrections were within 1% of complex MATLAB corrections. Conclusions: OCTAVIUS 1000 SRS ion recombination effects have little effect on 6 MV measurements. However, the effect could potentially be clinically significant for higher pulse dose unflattened beams when using tighter gamma tolerances, especially when small aperture sizes are used, as is common for SRS/SBRT. In addition, ion recombination effects are strongly correlated to changing MU/min, therefore MU/min used in daily 1000 SRS calibrations should be matched to the expected average MU/min of the IMRT plan.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

SU-D-206-06: Task-Specific Optimization of Scintillator Thickness for CMOS-Detector Based Cone-Beam Breast CT

Purpose: To optimize the cesium iodide (CsI:Tl) scintillator thickness in a complimentary metal-oxide semiconductor (CMOS)-based detector for use in dedicated cone-beam breast CT. Methods: The imaging task considered was the detection of a microcalcification cluster comprising six 220µm diameter calcium carbonate spheres, arranged in the form of a regular pentagon with 2 mm spacing on its sides and a central calcification, similar to that in ACR-recommended mammography accreditation phantom, at a mean glandular dose of 4.5 mGy. Generalized parallel-cascades based linear systems analysis was used to determine Fourier-domain image quality metrics in reconstructed object space, from which the detectability index inclusive of anatomical noise was determined for a non-prewhitening numerical observer. For 300 projections over 2π, magnification-associated focal-spot blur, Monte Carlo derived x-ray scatter, K-fluorescent emission and reabsorption within CsI:Tl, CsI:Tl quantum efficiency and optical blur, fiberoptic plate transmission efficiency and blur, CMOS quantum efficiency, pixel aperture function and additive noise, and filtered back-projection to isotropic 105µm voxel pitch with bilinear interpolation were modeled. Imaging geometry of a clinical prototype breast CT system, a 60 kV Cu/Al filtered x-ray spectrum from 0.3 mm focal spot incident on a 14 cm diameter semi-ellipsoidal breast were used to determine the detectability index for 300–600 µm thick (75µm increments) CsI:Tl. The CsI:Tl thickness that maximized the detectability index was considered optimal. Results: The limiting resolution (10% modulation transfer function, MTF) progressively decreased with increasing CsI:Tl thickness. The zero-frequency detective quantum efficiency, DQE(0), in projection space increased with increasing CsI:Tl thickness. The maximum detectability index was achieved with 525µm thick CsI:Tl scintillator. Reduced MTF at mid-to-high frequencies for 600µm thick CsI:Tl lowered the detectability index than 525µm CsI:Tl. Conclusion: For the x-ray spectrum and imaging conditions considered, a 525µm thick CsI:Tl scintillator integrated with the CMOS detector is optimal for detecting microcalcification cluster. Funding support: Supported in part by NIH R01 CA195512. The contents are solely the responsibility of the authors and do not reflect the official views of the NIH or the NCI. Disclosures: SV, GV and AK - Research collaboration, Koning Corp., West Henrietta, NY.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

Nonequilibrium molecular dynamics study of ring polymer melts under shear and elongation flows: A comparison with their linear analogs

We present detailed results for the structural and rheological properties of unknotted and unconcatenated ring polyethylene (PE) melts under shear and elongation flows via direct atomistic nonequilibrium molecular dynamics simulations. Short (C{sub 78}H{sub 156}) and long (C{sub 400}H{sub 800}) ring PE melts were subjected to planar Couette flow (PCF) and planar elongational flow (PEF) across a wide range of strain rates from linear to highly nonlinear flow regimes. The results are analyzed in detail through a direct comparison with those of the corresponding linear polymers. We found that, in comparison to their linear analogs, ring melts possess rather compact chain structures at or near the equilibrium state and exhibit a considerably lesser degree of structural deformation with respect to the applied flow strength under both PCF and PEF. The large structural resistance of ring polymers against an external flow field is attributed to the intrinsic closed-loop configuration of the ring and the topological constraint of nonconcatenation between ring chains in the melt. As a result, there appears to be a substantial discrepancy between ring and linear systems in terms of their structural and rheological properties such as chain orientation, the distribution of chain dimensions, viscosity, flow birefringence, hydrostatic pressure, the pair correlation function, and potential interaction energies. The findings and conclusions drawn in this work would be a useful guide in future exploration of the characteristic dynamical and relaxation mechanisms of ring polymers in bulk or confined systems under flowing conditions.

42 ENGINEERING↗
DOE OSTI2015

Spatiotemporal optical pulse transformation by a resonant diffraction grating

The diffraction of a spatiotemporal optical pulse by a resonant diffraction grating is considered. The pulse diffraction is described in terms of the signal (the spatiotemporal incident pulse envelope) passage through a linear system. An analytic approximation in the form of a rational function of two variables corresponding to the angular and spatial frequencies has been obtained for the transfer function of the system. A hyperbolic partial differential equation describing the general form of the incident pulse envelope transformation upon diffraction by a resonant diffraction grating has been derived from the transfer function. A solution of this equation has been obtained for the case of normal incidence of a pulse with a central frequency lying near the guided-mode resonance of a diffraction structure. The presented results of numerical simulations of pulse diffraction by a resonant grating show profound changes in the pulse envelope shape that closely correspond to the proposed theoretical description. The results of the paper can be applied in creating new devices for optical pulse shape transformation, in optical information processing problems, and analog optical computations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite. The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices

In this work, we describe a multilevel preconditioning technique for solving sparse symmetric linear systems of equations. This “Multilevel Schur Low-Rank” (MSLR) preconditioner first builds a tree structure $\mathcal{T}$ based on a hierarchical decomposition of the matrix and then computes an approximate inverse of the original matrix level by level. Unlike classical direct solvers, the construction of the MSLR preconditioner follows a top-down traversal of $\mathcal{T}$ and exploits a low-rank property that is satisfied by the difference between the inverses of the local Schur complements and specific blocks of the original matrix. A few steps of the generalized Lanczos tridiagonalization procedure are applied to capture most of this difference. Numerical results are reported to illustrate the efficiency and robustness of the MSLR preconditioner with both two- and three-dimensional discretized PDE problems and with publicly available test problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Reducing Parallel Communication in Algebraic Multigrid through Sparsification

Algebraic multigrid (AMG) is an $\mathcal{O}(n)$ solution process for many large sparse linear systems. A hierarchy of progressively coarser grids which utilize complementary relaxation and interpolation operators is constructed. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grid matrices and reduced there. However, large parallel communication costs often limit parallel scalability. Furthermore, as the multigrid hierarchy is formed, each coarse matrix is formed through a triple matrix product. The resulting coarse grids often have significantly more nonzeros per row than the original fine-grid operator, thereby generating high parallel communication costs associated with sparse matrix-vector multiplication (SpMV) on coarse levels. In this paper, we introduce a method that systematically removes entries in coarse-grid matrices after the hierarchy is formed, leading to improved communication costs. We sparsify by removing weakly connected or unimportant entries in the matrix, leading to improved solve time. The main trade-off is that if the heuristic identifying unimportant entries is used too aggressively, then AMG convergence can suffer. To counteract this, the original hierarchy is retained, allowing entries to be reintroduced into the solver hierarchy if convergence is too slow. This enables a balance between communication cost and convergence, as necessary. In this paper we present new algorithms for reducing communication and present a number of computational experiments in support.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids

We present an augmented matrix approach to update the solution to a linear system of equations when the coefficient matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform $N-x$ contingency analysis, i.e., determine the state of the system when up to $x$ links from $N$ fail. Our algorithms augment the coefficient matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the coefficient matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing $N-x$ contingency analysis on a $778K$ bus grid, updating a solution with $x=20$ elements in $1.6 \times 10^{-2}$ seconds on an Intel Xeon processor.

Yeung, Yu-Hong↗
DOE OSTI2018

A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations

Multigrid is a highly scalable class of methods most often used for solving large linear systems. In this paper we develop a nonlinear algebraic multigrid framework for the power flow equations, a complex quadratic system of the form ${diag}({v})\overline{Y{v}}={s}$, where $Y$ is approximately a complex scalar rotation of a real graph Laplacian. This is a standard problem that needs to be solved repeatedly during power grid simulations. A key difference between our multigrid framework and typical multigrid approaches is the use of a novel multiplicative coarse-grid correction to enable a dynamic multigrid hierarchy. We also develop a new type of smoother that allows one to coarsen together the different types of nodes that appear in power grid simulations. In developing a specific multigrid method, one must make a number of choices that can significantly affect the method's performance, such as how to construct the restriction and interpolation operators, what smoother to use, and how aggressively to coarsen. In this paper, we make simple but reasonable choices that result in a scalable and robust power flow solver. Experiments demonstrate this scalability and show that it is significantly more robust to poor initial guesses than current state-of-the-art solvers.

97 MATHEMATICS AND COMPUTING↗