Search NASA⌕ Search

SEARCH · Search NASA

Results for “matrix inversion”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

DECT-MULTRA: Dual-Energy CT Image Decomposition With Learned Mixed Material Models and Efficient Clustering

Dual-energy computed tomography (DECT) imaging plays an important role in advanced imaging applications due to its material decomposition capability. Image-domain decomposition operates directly on CT images using linear matrix inversion, but the decomposed material images can be severely degraded by noise and artifacts. This paper proposes a new method dubbed DECT-MULTRA for image-domain DECT material decomposition that combines conventional penalized weighted-least squares (PWLS) estimation with regularization based on a mixed union of learned transforms (MULTRA) model. Our proposed approach pre-learns a union of common-material sparsifying transforms from patches extracted from all the basis materials, and a union of cross-material sparsifying transforms from multi-material patches. The common-material transforms capture the common properties among different material images, while the cross-material transforms capture the cross-dependencies. The proposed PWLS formulation is optimized efficiently by alternating between an image update step and a sparse coding and clustering step, with both of these steps having closed-form solutions. The effectiveness of our method is validated with both XCAT phantom and clinical head data. The results demonstrate that our proposed method provides superior material image quality and decomposition accuracy compared to other competing methods.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Electromagnetic Transient (EMT) Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (T&D Models)

Simulation of high-fidelity models of extreme fast charging (XFC) systems and large-area power grids with many XFCs can be time consuming in traditional simulators. Traditional simulators use a single method of discretization for all the components that results in imposing a large computational burden of inverting a large matrix as well as increased computations related to single method of discretization (that is typically a trapezoidal method). To overcome the problem of simulating large-area power grids with many XFCs, in this paper, advanced numerical simulation algorithms are applied for the first time together to reduce the dimension of matrix inversion. Here, the algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. These algorithms apply multiple discretization algorithms rather than a single discretization algorithm that further reduces the computational burden. The approaches mentioned here have resulted in speed-up of up to 18x in the simulation of a single distribution system with 15 XFCs and of up to 271x in the simulation of a transmission-distribution system with 300 XFCs in multiple distribution feeders with respect to conventional simulators (like power systems computer aided design [PSCAD]).

42 ENGINEERING↗
DOE OSTI2022

SuperScreen: An open-source package for simulating the magnetic response of two-dimensional superconducting devices

Quantitative understanding of the spatial distribution of magnetic fields and Meissner screening currents in two-dimensional (2D) superconductors and mesoscopic thin film superconducting devices is critical to interpreting the results of magnetic measurements of such systems. Here, we introduce SuperScreen, an open-source Python package for simulating the response of 2D superconductors to trapped flux and applied time-independent or quasi-DC magnetic fields for any value of the effective magnetic penetration depth, Λ. Given an applied magnetic field, SuperScreen solves the 2D London equation using an efficient matrix inversion method to obtain the Meissner currents and magnetic fields in and around structures composed of one or more superconducting thin films of arbitrary geometry with spatially nonuniform magnetic penetration depth. SuperScreen can be used to model screening effects and calculate self- and mutual-inductance in superconducting devices, and simulate the magnetic response of inhomogeneous 2D superconductors.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Evading strength and ductility trade-off in an inverse nacre structured magnesium matrix nanocomposite

Mimicking nacre structure is an often-used strategy for developing materials which combine high strength and high toughness. Here, a novel strategy, named inverse nacre structure, is proposed where elongated and curled soft constituents are embedded in a matrix of hard constituent to form an ordered brick-and-mortar arrangement. This strategy is demonstrated in a particle reinforced metal matrix composite, using pure Mg as the soft phase and SiC nanoparticle reinforced Mg as the hard phase. In this work, the resulting nanocomposite yields high strength, and especially high tensile elongation which is five times that of the homogeneous counterpart. The superior comprehensive strengthening-toughening effect originates from the tailored inverse nacre structure which enables a stable microcrack-multiplication process by sufficiently promoting strain hardening so as to avoid any significant decrease in post-ultimate tensile strength. This strategy, while demonstrated here for the specific case of particle reinforced Mg, is not restricted to any particular material system but constitutes a generic pathway for the development of high-performance materials for engineering applications.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A Statistical Interpolation Code for Ocean Analysis and Forecasting

Abstract We present a data assimilation package for use with ocean circulation models in analysis, forecasting, and system evaluation applications. The basic functionality of the package is centered on a multivariate linear statistical estimation for a given predicted/background ocean state, observations, and error statistics. Novel features of the package include support for multiple covariance models, and the solution of the least squares normal equations either using the covariance matrix or its inverse—the information matrix. The main focus of this paper, however, is on the solution of the analysis equations using the information matrix, which offers several advantages for solving large problems efficiently. Details of the parameterization of the inverse covariance using Markov random fields are provided and its relationship to finite-difference discretizations of diffusion equations are pointed out. The package can assimilate a variety of observation types from both remote sensing and in situ platforms. The performance of the data assimilation methodology implemented in the package is demonstrated with a yearlong global ocean hindcast with a 1/4° ocean model. The code is implemented in modern Fortran, supports distributed memory, shared memory, multicore architectures, and uses climate and forecasts compliant Network Common Data Form for input/output. The package is freely available with an open source license from www.tendral.com/tsis/ .

Srinivasan, Ashwanth↗
DOE OSTI2022

Inverse Calculation of Burden Distribution Matrix Using B-spline Model Based PDF control in Blast Furnace Burden Charging Process

The inverse calculation of burden distribution matrix (BDM) is one of the most important challenges in the blast furnace operation in iron-making processes. In general, blast furnace consumes 65% of the total energy for the whole steel-making. Focusing on this practical challenge, this article proposes a new burden distribution spatial model in calculating burden charging process, and develops a B-spline approximation-based probability density function (PDF) control algorithm to assign the expected thickness distribution of burden layer and, thus, develops a new method for the required inverse calculation of BDM. First, a novel method for the thickness distribution of burden layer is given using B-spline model to produce an expected distribution shape subjected to a desired tracking within a specific spatial constraint. Then, according to the coexistence of continuous and bounded discrete variables in BDM, a novel hybrid optimization control method by combining integer programming and PDF tracking is further established for the effective inverse calculation of BDM. Finally, the proposed PDF-based iterative inverse calculation of BDM using B-spline models are tested using various data from industrial examples. Furthermore, the simulation results show that the proposed method is well suited to solve the BDM inverse calculation problem in practice.

42 ENGINEERING↗
DOE OSTI2022

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems

The sparse inverse covariance matrix is used to model conditional dependencies between variables in a graphical model to fit a multivariate Gaussian distribution. Estimating the matrix from data are well known to be computationally expensive for large-scale problems. Sparsity is employed to handle noise in the data and to promote interpretability of a learning model. Although the use of a convex ℓ 1 regularizer to encourage sparsity is common practice, the combinatorial ℓ 0 penalty often has more favorable statistical properties. In this paper, we directly constrain sparsity by specifying a maximally allowable number of nonzeros, in other words, by imposing an ℓ 0 constraint. Here, we introduce an efficient approximate Newton algorithm using warm starts for solving the nonconvex ℓ 0 -constrained inverse covariance learning problem. Numerical experiments on standard data sets show that the performance of the proposed algorithm is competitive with state-of-the-art methods.

$\ell_0$-Constrained↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
DOE OSTI2020

The Sylvester Graphical Lasso (SyGlasso)

This paper introduces the Sylvester graphical lasso (SyGlasso) that captures multiway dependencies present in tensor-valued data. The model is based on the Sylvester equation that defines a generative model. The proposed model complements the tensor graphical lasso that imposes a Kronecker sum model for the inverse covariance matrix by providing an alternative Kronecker sum model that is generative and interpretable. A nodewise regression approach is adopted for estimating the conditional independence relationships among variables. The statistical convergence of the method is established, and empirical studies are provided to demonstrate the recovery of meaningful conditional dependency graphs. Here we apply the SyGlasso to an electroencephalography (EEG) study to compare the brain connectivity of alcoholic and nonalcoholic subjects. Here, we demonstrate that our model can simultaneously estimate both the brain connectivity and its temporal dependencies.

Wang, Yu↗
DOE OSTI2021

Force Reconstruction Using the Inverse of the Mode-Shape Matrix [Book Chapter]

A new technique for force reconstruction is developed. To estimate the externally applied force, this technique sums the weight-scaled acceleration signals, and is referred to as the Sum of Weighted Accelerations Technique (SWAT). To obtain the scalar weights the inverse of the mode shape matrix is used. Application of this technique is illustrated with both numerical calculations using a mass-spring model and experimental data from a structure impacting a rigid barrier.

055001 -- Nuclear Fuels-- Safeguards, Inspection, ↗
DOE OSTI2020

Computationally Efficient Learning of Large Scale Dynamical Systems: A Koopman Theoretic Approach

In recent years there has been a considerable drive towards data-driven analysis, discovery and control of dynamical systems. To this end, operator theoretic methods, namely, Koopman operator methods have gained a lot of interest. In general, the Koopman operator is obtained as a solution to a least-squares problem, and as such, the Koopman operator can be expressed as a closed-form solution that involves the computation of Moore-Penrose inverse of a matrix. For high dimensional systems and also if the size of the obtained data-set is large, the computation of the Moore-Penrose inverse becomes computationally challenging. In this paper, we provide an algorithm for computing the Koopman operator for high dimensional systems in a time-efficient manner. We further demonstrate the efficacy of the proposed approach on two different systems, namely a network of coupled oscillators (with state-space dimension up to 2500) and IEEE 68 bus system (with state-space dimension 204 and up to 24,000 time-points).

Sinha, Subhrajit↗
DOE OSTI2021

Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion

SUMMARY Full-waveform inversion has become an essential technique for mapping geophysical subsurface structures. However, proper uncertainty quantification is often lacking in current applications. In theory, uncertainty quantification is related to the inverse Hessian (or the posterior covariance matrix). Even for common geophysical inverse problems its calculation is beyond the computational and storage capacities of the largest high-performance computing systems. In this study, we amend the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to perform uncertainty quantification for large-scale applications. For seismic inverse problems, the limited-memory BFGS (L-BFGS) method prevails as the most efficient quasi-Newton method. We aim to augment it further to obtain an approximate inverse Hessian for uncertainty quantification in FWI. To facilitate retrieval of the inverse Hessian, we combine BFGS (essentially a full-history L-BFGS) with randomized singular value decomposition to determine a low-rank approximation of the inverse Hessian. Setting the rank number equal to the number of iterations makes this solution efficient and memory-affordable even for large-scale problems. Furthermore, based on the Gauss–Newton method, we formulate different initial, diagonal Hessian matrices as pre-conditioners for the inverse scheme and compare their performances in elastic FWI applications. We highlight our approach with the elastic Marmousi benchmark model, demonstrating the applicability of pre-conditioned BFGS for large-scale FWI and uncertainty quantification.

58 GEOSCIENCES↗
DOE OSTI2021

Constraints on a massive double-copy and applications to massive gravity

We propose and study a BCJ double-copy of massive particles, showing that it is equivalent to a KLT formula with a kernel given by the inverse of a matrix of massive bi-adjoint scalar amplitudes. For models with a uniform non-zero mass spectrum we demonstrate that the resulting double-copy factors on physical poles and that up to at least 5-particle scattering, color-kinematics duality satisfying numerators always exist. For the scattering of 5 or more particles, the procedure generically introduces spurious singularities that must be cancelled by imposing additional constraints. When massive particles are present, color-kinematics duality is not enough to guarantee a physical double-copy. As an example, we apply the formalism to massive Yang-Mills and show that up to 4-particle scattering the double-copy construction generates physical amplitudes of a model of dRGT massive gravity coupled to a dilaton and a two-form with dilaton parity violating couplings. We show that the spurious singularities in the 5-particle double-copy do not cancel in this example, and the construction fails to generate physically sensible amplitudes. We conjecture sufficient constraints on the mass spectrum, which in addition to massive BCJ relations, guarantee the absence of spurious singularities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Ultra-wideband mutual coupling compensation of active electronically scanned arrays in multi-channel radar systems

Technologies pertaining to the calibration of ultra-wide-band active-electronically-scanned arrays to compensate for transmit and receive mutual coupling between array elements and/or non-ideal isolated channels are described herein. A plurality of near-field measurements are taken by way of probe or probes that may be moved among a plurality of positions aligned with respective elements in the array. For each position of the probe, each of the elements of the array is stimulated to transmit or receive a calibration signal to or from the probe, respectively. Frequency-domain transfer functions are computed from the received signals by the probe or the element for each of the array elements in each of the positions of the probe. The inverse of the matrix of transfer functions comprise frequency-domain transmit and receive correction factors that are used to modify desired array inputs/outputs such that the modified signals correct for mutual coupling between elements in the array.

42 ENGINEERING↗
DOE OSTI2021

A Butterfly-Accelerated Volume Integral Equation Solver for Broad Permittivity and Large-Scale Electromagnetic Analysis

In this work, a butterfly-accelerated volume integral equation (VIE) solver is proposed for fast and accurate electromagnetic (EM) analysis of scattering from heterogeneous objects. The proposed solver leverages the hierarchical off-diagonal butterfly (HOD-BF) scheme to construct the system matrix and obtain its approximate inverse, used as a preconditioner. Complexity analysis and numerical experiments validate the O(N log 2 N) construction cost of the HOD-BF-compressed system matrix and O(N log 1.5 N) inversion cost for the preconditioner, where N is the number of unknowns in the high-frequency EM scattering problem. For many practical scenarios, the proposed VIE solver requires less memory and computational time to construct the system matrix and obtain its approximate inverse compared to a H matrix-accelerated VIE solver. The accuracy and efficiency of the proposed solver have been demonstrated via its application to the EM analysis of large-scale canonical and real-world structures comprising of broad permittivity values and involving millions of unknowns.

42 ENGINEERING↗
DOE OSTI2022

Density matrix renormalization group description of the island of inversion isotopes F 28 – 33

Recent experiments have confirmed that the neutron-rich isotopes 28,29 F belong to the so-called island of inversion (IOI), a region of the nuclear chart around Z = 10 and N = 20 where nuclear structure deviates from the standard shell model predictions due to deformation and continuum effects. However, while the general principles leading to the IOI are relatively well understood, the details of the low-lying structure of the exotic fluorine isotopes 28–33 F are basically unknown. In this study, we perform large-scale shell model calculations including continuum states to investigate the properties of the neutron-rich isotopes 25–33 F, from a core of 24 O and using an effective two-body interaction with a small number of adjustable parameters in the central and tensor channels. We develop two models adjusted on experimentally confirmed states in 25,26 O and 25–27 F based on different assumptions concerning the positions of the neutron 0d 3/2 and 1p 3/2 shells, and solve the many-body problem using the density matrix renormalization group (DMRG) method for open quantum systems in an sd–fp model space. We obtain the first detailed spectroscopy of 25–33F in the continuum and show how the interplay between continuum effects and deformation explains the recent data on 28,29 F. Several deformed one- and two-neutron halo states are predicted in 29,31 F, and we provide some information about the possible structure of the heaviest fluorine isotopes. We also suggest several experimental studies of interest to constraint models and test the present predictions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Fast matrix algebra for Bayesian model calibration

In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. Here, we also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation

97 MATHEMATICS AND COMPUTING↗