Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix approximation”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Success and breakdown of the T-matrix approximation for phonon-disorder scattering

Here, we examine the validity of the widely used T-matrix approximation for treating phonon-disorder scattering by implementing an unfolding algorithm that allows simulation of disorder up to tens of millions of atoms. The T-matrix approximation breaks down for low-energy flexure phonons that play an important role in thermal transport in two-dimensional materials. Furthermore, insights are developed into the success of the T-matrix approximation in describing maximally mass disordered systems. To achieve this, the phonon unfolding formalism is generalized to describe mass disorder and strongly nonperturbative features of the spectrum are connected to the Boltzmann quasiparticle picture.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1980

A study of the effects of state transition matrix approximations

The effects of using an approximate state transition matrix in orbit estimation are investigated. The approximate state transition matrix results when higher order geopotential terms in the equations of motion are ignored in the formation of the variational equations. Two methods of orbit estimation are considered: the differential correction procedure (DC) and the extended Kalman filter (EKF). The system used for the study is the Research & Development version of the Goddard Trajectory Determination System. The effects of the approximation are analyzed on a number of orbits. These orbits of various inclinations and semimajor axes. Other parameters studied include geopotential models and DC arc length.

May, J. A.↗
DOE OSTI2021

Nonlinear Matrix Approximation with Radial Basis Function Components

We introduce and investigate matrix approximation by decomposition into a sum of radial basis function (RBF) components. An RBF component is a generalization of the outer product between a pair of vectors, where an RBF function replaces the scalar multiplication between individual vector elements. Even though the RBF functions are positive definite, the summation across components is not restricted to convex combinations and allows us to compute the decomposition for any real matrix that is not necessarily symmetric or positive definite. We formulate the problem of seeking such a decomposition as an optimization problem with a nonlinear and non-convex loss function. Several modern versions of the gradient descent method, including their scalable stochastic counterparts, are used to solve this problem. We provide extensive empirical evidence of the effectiveness of the RBF decomposition and that of the gradient-based fitting algorithm. While being conceptually motivated by singular value decomposition (SVD), our proposed nonlinear counterpart outperforms SVD by drastically reducing the memory required to approximate a data matrix with the same L2 error for a wide range of matrix types. For example, it leads to 2 to 6 times memory save for Gaussian noise, graph adjacency matrices, and kernel matrices. Moreover, this proximity-based decomposition can offer additional interpretability in applications that involve, e.g., capturing the inner low-dimensional structure of the data, retaining graph connectivity structure, and preserving the acutance of images.

Rebrova, Elizaveta↗
DOE OSTI2024

Posterior Covariance Matrix Approximations

Here, the Davis equation of state (EOS) is commonly used to model thermodynamic relationships for high explosive (HE) reactants. Typically, the parameters in the EOS are calibrated, with uncertainty, using a Bayesian framework and Markov Chain Monte Carlo (MCMC) methods. However, MCMC methods are computationally expensive, especially for complex models with many parameters. This paper provides a comparison between MCMC and less computationally expensive Variational methods (Variational Bayesian and Hessian Variational Bayesian) for computing the posterior distribution and approximating the posterior covariance matrix based on heterogeneous experimental data. All three methods recover similar posterior distributions and posterior covariance matrices. This study demonstrates that for this EOS parameter calibration application, the assumptions made in the two Variational methods significantly reduce the computational cost but do not substantially change the results compared to MCMC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Graph Sparsification by Approximate matrix Multiplication

Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of sparsifying a weighted graph, while sharing the same vertices as the original graph but reducing the number of edges, is through spectral sparsification. We study this problem through the perspective of RandNLA. Specifically, we utilize randomized matrix multiplication to give a clean and simple analysis of how sampling according to edge weights gives a spectral approximation to graph Laplacians, without requiring spectral information. Through the CR–MM algorithm, we attain a simple and computationally efficient sparsifier whose resulting Laplacian estimate is unbiased and of minimum variance. Here, we define a new notion of additive spectral sparsifiers, which has not been considered in the literature.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

Optimal matrix approximants in structural identification

Problems of model correlation and system identification are central in the design, analysis, and control of large space structures. Of the numerous methods that have been proposed, many are based on finding minimal adjustments to a model matrix sufficient to introduce some desirable quality into that matrix. In this work, several of these methods are reviewed, placed in a modern framework, and linked to other previously known ideas in computational linear algebra and optimization. This new framework provides a point of departure for a number of new methods which are introduced here. Significant among these is a method for stiffness matrix adjustment which preserves the sparsity pattern of an original matrix, requires comparatively modest computational resources, and allows robust handling of noisy modal data. Numerical examples are included to illustrate the methods presented herein.

Beattie, C. A.↗
DOE OSTI2021

Twisted bilayer graphene. I. Matrix elements, approximations, perturbation theory, and a k · p two-band model

We investigate the twisted bilayer graphene (TBG) model of Bistritzer and MacDonald (BM) [Bistritzer and MacDonald, Proc. Natl. Acad. Sci. 108, 12233 (2011)] to obtain an analytic understanding of its energetics and wave functions needed for many-body calculations. We provide an approximation scheme for the wave functions of the BM model, which first elucidates why the BM K M -point centered original calculation containing only four plane waves provides a good analytical value for the first magic angle (θ M ≈ 1°). The approximation scheme also elucidates why most of the many-body matrix elements in the Coulomb Hamiltonian projected to the active bands can be neglected. By applying our approximation scheme at the first magic angle to a Γ M -point centered model of six plane waves, we analytically understand the reason for the small Γ M -point gap between the active and passive bands in the isotropic limit w 0 = w 1 . Furthermore, we analytically calculate the group velocities of the passive bands in the isotropic limit, and show that they are almost doubly degenerate, even away from the Γ M point, where no symmetry forces them to be. Furthermore, moving away from the Γ M and K M points, we provide an explicit analytical perturbative understanding as to why the TBG bands are flat at the first magic angle, despite the first magic angle is defined by only requiring a vanishing K M -point Dirac velocity. We derive analytically a connected “magic manifold” w 1 = $2\sqrt{1 + w^{2}_{0}}$ $-\sqrt{2 + 3w^2_0}$, on which the bands remain extremely flat as w 0 is tuned between the isotropic (w 0 = w 1 ) and chiral (w 0 = 0) limits. We analytically show why going away from the isotropic limit by making w 0 less (but not larger) than w 1 increases the Γ M -point gap between the active and the passive bands. Finally, by perturbation theory, we provide an analytic Γ M point k ∙ p two-band model that reproduces the TBG band structure and eigenstates within a certain w 0 , w 1 parameter range. Further refinement of this model are discussed, which suggest a possible faithful representation of the TBG bands by a two-band Γ M point k ∙ p model in the full w 0 , w 1 parameter range.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Fast truncated SVD of sparse and dense matrices on graphics processors

We investigate the solution of low-rank matrix approximation problems using the truncated singular value decomposition (SVD). For this purpose, we develop and optimize graphics processing unit (GPU) implementations for the randomized SVD and a blocked variant of the Lanczos approach. Our work takes advantage of the fact that the two methods are composed of very similar linear algebra building blocks, which can be assembled using numerical kernels from existing high-performance linear algebra libraries. Furthermore, the experiments with several sparse matrices arising in representative real-world applications and synthetic dense test matrices reveal a performance advantage of the block Lanczos algorithm when targeting the same approximation accuracy.

Computer Science↗
NASA NTRS1995

Optimization of Time-Dependent Particle Tracing Using Tetrahedral Decomposition

An efficient algorithm is presented for computing particle paths, streak lines and time lines in time-dependent flows with moving curvilinear grids. The integration, velocity interpolation and step-size control are all performed in physical space which avoids the need to transform the velocity field into computational space. This leads to higher accuracy because there are no Jacobian matrix approximations or expensive matrix inversions. Integration accuracy is maintained using an adaptive step-size control scheme which is regulated by the path line curvature. The problem of cell-searching, point location and interpolation in physical space is simplified by decomposing hexahedral cells into tetrahedral cells. This enables the point location to be done analytically and substantially faster than with a Newton-Raphson iterative method. Results presented show this algorithm is up to six times faster than particle tracers which operate on hexahedral cells yet produces almost identical particle trajectories.

Kenwright, David↗
DOE OSTI2025

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗
NASA NTRS2000

Low-dimensional Representation of Error Covariance

Ensemble and reduced-rank approaches to prediction and assimilation rely on low-dimensional approximations of the estimation error covariances. Here stability properties of the forecast/analysis cycle for linear, time-independent systems are used to identify factors that cause the steady-state analysis error covariance to admit a low-dimensional representation. A useful measure of forecast/analysis cycle stability is the bound matrix, a function of the dynamics, observation operator and assimilation method. Upper and lower estimates for the steady-state analysis error covariance matrix eigenvalues are derived from the bound matrix. The estimates generalize to time-dependent systems. If much of the steady-state analysis error variance is due to a few dominant modes, the leading eigenvectors of the bound matrix approximate those of the steady-state analysis error covariance matrix. The analytical results are illustrated in two numerical examples where the Kalman filter is carried to steady state. The first example uses the dynamics of a generalized advection equation exhibiting nonmodal transient growth. Failure to observe growing modes leads to increased steady-state analysis error variances. Leading eigenvectors of the steady-state analysis error covariance matrix are well approximated by leading eigenvectors of the bound matrix. The second example uses the dynamics of a damped baroclinic wave model. The leading eigenvectors of a lowest-order approximation of the bound matrix are shown to approximate well the leading eigenvectors of the steady-state analysis error covariance matrix.

Tippett, Michael K.↗
DOE OSTI2023

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Fast increased fidelity samplers for approximate Bayesian Gaussian process regression

Gaussian processes (GPs) are common components in Bayesian non-parametric models having a rich methodological literature and strong theoretical grounding. The use of exact GPs in Bayesian models is limited to problems containing several thousand observations due to their prohibitive computational demands. We develop a posterior sampling algorithm using H-matrix approximations that scales at O(n log 2 n). We show that this approximation’s Kullback-Leibler divergence to the true posterior can be made arbitrarily small. Though multidimensional GPs could be used with our algorithm, d-dimensional surfaces are modeled as tensor products of univariate GPs to minimize the cost of matrix construction and maximize computational efficiency. We illustrate the performance of this fast increased fidelity approximate GP, FIFA-GP, using both simulated and non-synthetic data sets

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2017

Organic Matter in Extraterrestrial Water-Bearing Salt Crystals

Introduction: Direct samples of early Solar System fluids are present in two thermally-metamorphosed ordinary chondrite regolith breccias (Monahans (1998) [H5] and Zag [H3-6]), which were found to contain brine-bearing halite (NaCl) crystals that have been added to the regolith of an S-type asteroid following asteroidal metamorphism [1, 2]. The brine-bearing halite grains were proposed to be formed on an icy C-type asteroids (possibly Ceres), and transferred to an S-type asteroid via cryovolcanic event(s) [3]. A unique aspect of these halites is that they contain abundant organic rich solid inclusions hosted within the halites alongside the water inclusions. Methods: We analyzed in detail the compositions of the organic solids and the amino acid content of the halite crystals with two-step laser desorption/laser ionization mass spectrometry (L(sup 2) MS), Raman spectroscopy, X-ray absorption near edge structure (XANES), nanoscale secondary ion mass spectrometry (NanoSIMS), and ultra-performance liquid chromatography fluorescence detection and quadrupole time of flight hybrid mass spectrometry (UPLC-FD/QToF-MS). Results and Discussion: The L(sup 2) MS results show signatures of low-mass polyaromatic hydro-carbons (PAHs) indicated by sequences of peaks separated by 14 atomic mass units (amu) due to successive addition of methylene (CH2) groups to the PAH skeletons [4]. Raman spectra of the micron-sized solid inclusions of the halites indicate the presence of abundant and highly variable organic matter that include a mixture of short-chain aliphatic compounds and macromolecular carbon. C-XANES analysis identified C-rich areas with peaks at 285.0 eV (aromatic C=C) and 286.6 eV (vinyl-keto C=O). However, there is no 1s-sigma* exciton peak (291.7 eV) that is indicative of the development of graphene structure [5], which suggests the organics were synthesized cold. Na-noSIMS analyses show C-rich and N-rich areas that exhibit similar isotopic values with that of the IOM in the unweathered CR chondrites and less metamorphosed meteorites [6], and are moderately enriched in N-15 (delta N-15 = 106.1-164.5 per mille). The total amino acid distribution and abundance of the Zag matrix (approximately 1,940 parts per billion [ppb]) is comparable to other ordinary chondrites (60-3,330 ppb) [7, 8]. While the Zag matrix is gamma-ABA and EACA-deficient, the halite is shown to exhibit an opposite trend and is almost depleted in amino acids. The striking difference in the amino acid contents between the halite and matrix indicates their separate synthetic origins. Conclusion: Abundant, primitive, and highly-diverse N-15-rich organic compounds were detected in brine-water bearing halite crystals that were synthesized on a cryovolcanically-active asteroid. Our study suggests that the asteroidal parent body where the halite precipitated, potentially Ceres, is a host to abundance large variety organic precursors. Insoluble organic matter and amino acids can be synthesized from similar organic precusors under hydrous conditions [9].We envision that similar organic synthetic processes could have occurred on Ceres that synthesized organic solids as well as biologically relevant molecules.

Chan, Q. H. S.↗
DOE OSTI2024

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗