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

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↗

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↗

Multiple scattering corrections to the T-matrix approximation: Unified theory of normal and superconducting states

We present unified theory of both normal and superconducting states based on the fully self-consistent T-matrix approximation. We argue that the failure of the customary T-matrix approach below the critical temperature is caused by nonphysical repeated collisions. We eliminated the repeated collisions from the Galitskii-Feynman approximation. Obtained corrections are proportional to the inverse volume in the normal state and, thus, vanish in the thermodynamical limit. In the superconducting state these corrections remain finite and describe the Bardeen-Cooper-Schrieffer (BCS) gap. The T-matrix approach goes beyond mean-field BCS theory. It is, thus, well suited for studies of the systems with large fluctuations such as the BCS-Bose-Einstein-condensate crossover or size effects in small metallic grains and the nuclear matter.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Technique for information retrieval using enhanced latent semantic analysis generating rank approximation matrix by factorizing the weighted morpheme-by-document matrix

A technique for information retrieval includes parsing a corpus to identify a number of wordform instances within each document of the corpus. A weighted morpheme-by-document matrix is generated based at least in part on the number of wordform instances within each document of the corpus and based at least in part on a weighting function. The weighted morpheme-by-document matrix separately enumerates instances of stems and affixes. Additionally or alternatively, a term-by-term alignment matrix may be generated based at least in part on the number of wordform instances within each document of the corpus. At least one lower rank approximation matrix is generated by factorizing the weighted morpheme-by-document matrix and/or the term-by-term alignment matrix.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

The matrix product approximation for the dynamic cavity method

Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages—conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced, and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber–Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. Here, we discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

spammpack, Version 2013-06-18

This library is an implementation of the Sparse Approximate Matrix Multiplication (SpAMM) algorithm introduced. It provides a matrix data type, and an approximate matrix product, which exhibits linear scaling computational complexity for matrices with decay. The product error and the performance of the multiply can be tuned by choosing an appropriate tolerance. The library can be compiled for serial execution or parallel execution on shared memory systems with an OpenMP capable compiler

Source record↗

spammpack, Version 2013-06-18

This library is an implementation of the Sparse Approximate Matrix Multiplication (SpAMM) algorithm introduced. It provides a matrix data type, and an approximate matrix product, which exhibits linear scaling computational complexity for matrices with decay. The product error and the performance of the multiply can be tuned by choosing an appropriate tolerance. The library can be compiled for serial execution or parallel execution on shared memory systems with an OpenMP capable compiler

Source record↗

Correlation matrix renormalization approximation for total-energy calculations of correlated electron systems

We generalized the commonly used Gutzwiller approximation for calculating the electronic structure and total energy of strongly correlated electron systems. In our method, the evaluation of one-body and two-body density matrix elements of the Hamiltonian is simplified using a renormalization approximation to achieve better scaling of the computational effort as a function of system size. To achieve a clear presentation of the concept and methodology, we describe the detailed formalism for a finite hydrogen system with minimal basis set. We applied the correlation matrix renormalization approximation approach to a H 2 dimer and H 8 cubic fragment with minimal basis sets, as well as a H 2 molecule with a large basis set. The results compare favorably with sophisticated quantum chemical calculations. We believe our approach can serve as an alternative way to build up the exchange-correlation energy functional for an improved density functional theory description of systems with strong electron correlations.

36 MATERIALS SCIENCE↗

Robust validation of approximate 1-matrix functionals with few-electron harmonium atoms

A simple comparison between the exact and approximate correlation components U of the electron-electron repulsion energy of several states of few-electron harmonium atoms with varying confinement strengths provides a stringent validation tool for 1-matrix functionals. The robustness of this tool is clearly demonstrated in a survey of 14 known functionals, which reveals their substandard performance within different electron correlation regimes. Unlike spot-testing that employs dissociation curves of diatomic molecules or more extensive benchmarking against experimental atomization energies of molecules comprising some standard set, the present approach not only uncovers the flaws and patent failures of the functionals but, even more importantly, also allows for pinpointing their root causes. Since the approximate values of U are computed at exact 1-densities, the testing requires minimal programming and thus is particularly suitable for rapid screening of new functionals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

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↗

A Study of Clustering Techniques and Hierarchical Matrix Formats for Kernel Ridge Regression

We present memory-efficient and scalable algorithms for kernel methods used in machine learning. Using hierarchical matrix approximations for the kernel matrix the memory requirements, the number of floating point operations, and the execution time are drastically reduced compared to standard dense linear algebra routines. We consider both the general H matrix hierarchical format as well as Hierarchically Semi-Separable (HSS) matrices. Furthermore, we investigate the impact of several preprocessing and clustering techniques on the hierarchical matrix compression. Effective clustering of the input leads to a ten-fold increase in efficiency of the compression. The algorithms are implemented using the STRUMPACK solver library. These results confirm that - with correct tuning of the hyperparameters - classification using kernel ridge regression with the compressed matrix does not lose prediction accuracy compared to the exact - not compressed - kernel matrix and that our approach can be extended to O(1M) datasets, for which computation with the full kernel matrix becomes prohibitively expensive. We present numerical experiments in a distributed memory environment up to 1,024 processors of the NERSC's Cori supercomputer using well-known datasets to the machine learning community that range from dimension 8 up to 784.

97 MATHEMATICS AND COMPUTING↗

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↗

Solvers for $\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit

Here we present a hybrid OpenMP/Charm\tt++ framework for solving the $\mathcal{O} (N)$ self-consistent-field eigenvalue problem with parallelism in the strong scaling regime, $P\gg{N}$, where $P$ is the number of cores, and $N$ is a measure of system size, i.e., the number of matrix rows/columns, basis functions, atoms, molecules, etc. This result is achieved with a nested approach to spectral projection and the sparse approximate matrix multiply [Bock and Challacombe, SIAM J. Sci. Comput., 35 (2013), pp. C72--C98], and involves a recursive, task-parallel algorithm, often employed by generalized $N$-Body solvers, to occlusion and culling of negligible products in the case of matrices with decay. Lastly, employing classic technologies associated with generalized $N$-Body solvers, including overdecomposition, recursive task parallelism, orderings that preserve locality, and persistence-based load balancing, we obtain scaling beyond hundreds of cores per molecule for small water clusters ([H${}_2$O]${}_N$, $N \in \{ 30, 90, 150 \}$, $P/N \approx \{ 819, 273, 164 \}$) and find support for an increasingly strong scalability with increasing system size $N$.

97 MATHEMATICS AND COMPUTING↗

Statistics of subgap states in s{plus_minus} superconductors.

There is strong support in favor of an unusual s{+-} superconducting state in the recently discovered iron-based superconductors in which the gap parameter has opposite signs in different bands. In this case, scattering between different bands by impurities has a pair-breaking effect and introduces states inside the gap. We studied the statistics of disorder-induced subgap states in s{+-} superconductors due to collective effects of impurities. Numerically solving the two-band Bogolyubov equations, we explored the behavior of the density of states and localization length. We located the mobility edge separating the localized and delocalized states for the three-dimensional case and the crossover between the weak and strong localization regimes for the two-dimensional case. We found that the widely used self-consistent T-matrix approximation is not very accurate in describing subgap states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗