Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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

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↗

Role of vertex corrections in the matrix formulation of the random phase approximation for the multiorbital Hubbard model

In the framework of a multiorbital Hubbard model description of superconductivity, a matrix formulation of the superconducting pairing interaction that has been widely used is designed to treat spin, charge, and orbital fluctuations within a random phase approximation (RPA). In terms of Feynman diagrams, this takes into account particle-hole ladder and bubble contributions as expected. It turns out, however, that this matrix formulation also generates additional terms which have the diagrammatic structure of vertex corrections. Furthermore we examine these terms and discuss the relationship between the matrix-RPA superconducting pairing interaction and the Feynman diagrams that it sums.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗

Extended Lagrangian Excited State Molecular Dynamics

In this work, an extended Lagrangian framework for excited state molecular dynamics (XL-ESMD) using time-dependent self-consistent field theory is proposed. The formulation is a generalization of the extended Lagrangian formulations for ground state Born–Oppenheimer molecular dynamics [Phys. Rev. Lett. 2008 100, 123004]. The theory is implemented, demonstrated, and evaluated using a time-dependent semiempirical model, though it should be generally applicable to ab initio theory. The simulations show enhanced energy stability and a significantly reduced computational cost associated with the iterative solutions of both the ground state and the electronically excited states. Relaxed convergence criteria can therefore be used both for the self-consistent ground state optimization and for the iterative subspace diagonalization of the random phase approximation matrix used to calculate the excited state transitions. In conclusion, the XL-ESMD approach is expected to enable numerically efficient excited state molecular dynamics for such methods as time-dependent Hartree–Fock (TD-HF), Configuration Interactions Singles (CIS), and time-dependent density functional theory (TD-DFT).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Double, Rydberg and charge transfer excitations from pairing matrix fluctuation and particle-particle random phase approximation

Double, Rydberg, and charge transfer (CT) excitations have been great challenges for time-dependent density functional theory (TDDFT). Starting from an (N ± 2)-electron single-determinant reference, we investigate excitations for the N-electron system through the pairing matrix fluctuation, which contains information on two-electron addition/removal processes. We adopt the particle-particle random phase approximation (pp-RPA) and the particle-particle Tamm-Dancoff approximation (pp-TDA) to approximate the pairing matrix fluctuation and then determine excitation energies by the differences of two-electron addition/removal energies. This approach captures all types of interesting excitations: single and double excitations are described accurately, Rydberg excitations are in good agreement with experimental data and CT excitations display correct 1/R dependence. Furthermore, the pp-RPA and the pp-TDA have a computational cost similar to TDDFT and consequently are promising for practical calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Running sums for 2{nu}{beta}{beta}-decay matrix elements within the quasiparticle random-phase approximation with account for deformation

The 2{nu}{beta}{beta}-decay running sums for {sup 76}Ge and {sup 150}Nd nuclei are calculated within a QRPA approach with account for deformation. A realistic nucleon-nucleon residual interaction based on the Brueckner G matrix (for the Bonn CD force) is used. The influence of different model parameters on the functional behavior of the running sums is studied. It is found that the parameter g{sub pp} renormalizing the G matrix in the QRPA particle-particle channel is responsible for a qualitative change in behavior of the running sums at higher excitation energies. For realistic values of g{sub pp} a significant negative contribution to the total 2{nu}{beta}{beta}-decay matrix element is found to come from the energy region of the giant Gamow-Teller resonance. This behavior agrees with results of other authors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Exchange-correlation energy from pairing matrix fluctuation and the particle-particle random phase approximation

Despite their unmatched success for many applications, commonly used local, semi-local, and hybrid density functionals still face challenges when it comes to describing long-range interactions, static correlation, and electron delocalization. Density functionals of both the occupied and virtual orbitals are able to address these problems. The particle-hole (ph-) Random Phase Approximation (RPA), a functional of occupied and virtual orbitals, has recently known a revival within the density functional theory community. Following up on an idea introduced in our recent communication [H. van Aggelen, Y. Yang, and W. Yang, Phys. Rev. A 88, 030501 (2013)], we formulate more general adiabatic connections for the correlation energy in terms of pairing matrix fluctuations described by the particle-particle (pp-) propagator. With numerical examples of the pp-RPA, the lowest-order approximation to the pp-propagator, we illustrate the potential of density functional approximations based on pairing matrix fluctuations. The pp-RPA is size-extensive, self-interaction free, fully anti-symmetric, describes the strong static correlation limit in H{sub 2}, and eliminates delocalization errors in H{sub 2}{sup +} and other single-bond systems. It gives surprisingly good non-bonded interaction energies – competitive with the ph-RPA – with the correct R{sup −6} asymptotic decay as a function of the separation R, which we argue is mainly attributable to its correct second-order energy term. While the pp-RPA tends to underestimate absolute correlation energies, it gives good relative energies: much better atomization energies than the ph-RPA, as it has no tendency to underbind, and reaction energies of similar quality. The adiabatic connection in terms of pairing matrix fluctuation paves the way for promising new density functional approximations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Partial transpose of random quantum states: Exact formulas and meanders

We investigate the asymptotic behavior of the empirical eigenvalues distribution of the partial transpose of a random quantum state. The limiting distribution was previously investigated via Wishart random matrices indirectly (by approximating the matrix of trace 1 by the Wishart matrix of random trace) and shown to be the semicircular distribution or the free difference of two free Poisson distributions, depending on how dimensions of the concerned spaces grow. Our use of Wishart matrices gives exact combinatorial formulas for the moments of the partial transpose of the random state. We find three natural asymptotic regimes in terms of geodesics on the permutation groups. Two of them correspond to the above two cases; the third one turns out to be a new matrix model for the meander polynomials. Moreover, we prove the convergence to the semicircular distribution together with its extreme eigenvalues under weaker assumptions, and show large deviation bound for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗

Almost sure convergence in quantum spin glasses

Recently, Keating, Linden, and Wells [Markov Processes Relat. Fields 21(3), 537-555 (2015)] showed that the density of states measure of a nearest-neighbor quantum spin glass model is approximately Gaussian when the number of particles is large. The density of states measure is the ensemble average of the empirical spectral measure of a random matrix; in this paper, we use concentration of measure and entropy techniques together with the result of Keating, Linden, and Wells to show that in fact the empirical spectral measure of such a random matrix is almost surely approximately Gaussian itself with no ensemble averaging. We also extend this result to a spherical quantum spin glass model and to the more general coupling geometries investigated by Erdős and Schröder [Math. Phys., Anal. Geom. 17(3-4), 441–464 (2014)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗

The effective dielectric constant of plasmas - A mean field theory built from the electromagnetic ionic T-matrix

This work aims to obtain the effective dielectric constant tensor of a warm plasma in the spirit of the derivation of a mixing law. The medium is made of non point-like ions immersed in an electron gas with usual conditions relating the various lengths which define the problem. In this paper the ion dielectric constants are taken from their RPA responses as developed in a previous paper [1]. Furthermore the treatment of the screening effects is made through a mathematical redefinition of the initial problem as proposed in Ref. [1]. Here the complete calculation of the T-matrix describing the scattering of an electromagnetic wave on an isolated ion immersed in an 'effective medium' is given. It is used for building , in the spirit of a mixing law, a self-consistent effective medium theory for the plasma dielectric tensor. We then extend the results obtained in Ref. [1] to higher orders in ion or dielectric inclusion densities. The techniques presented are generic and can be used in areas such as elasticity, thermoelasticity, and piezoelectricity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universality for 1d Random Band Matrices: Sigma-Model Approximation

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233–1260, 2016; Commun Math Phys 351:1009–1044, 2017). We consider random Hermitian block band matrices consisting of W×W random Gaussian blocks (parametrized by j,k∈Λ=[1,n]{sup d}∩ℤ{sup d}) with a fixed entry’s variance J{sub jk}=δ{sub j,k}W{sup −1}+βΔ{sub j,k}W{sup −2}, β>0 in each block. Taking the limit W→∞ with fixed n and β, we derive the sigma-model approximation of the second correlation function similar to Efetov’s one. Then, considering the limit β,n→∞, we prove that in the dimension d=1 the behaviour of the sigma-model approximation in the bulk of the spectrum, as β≫n, is determined by the classical Wigner–Dyson statistics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Double beta decays of {sup 106}Cd

The two-neutrino (2{nu}2{beta}) and neutrinoless (0{nu}2{beta}) double beta decays of {sup 106}Cd are studied for the transitions to the ground state 0{sub gs}{sup +} and 0{sup +} and 2{sup +} excited states in {sup 106}Pd by using realistic many-body wave functions calculated in the framework of the quasiparticle random-phase approximation. Effective, G-matrix-derived nuclear forces are used in realistic single-particle model spaces. All the possible channels, {beta}{sup +}{beta}{sup +}, {beta}{sup +}EC, and ECEC, are discussed for both the 2{nu}2{beta} and 0{nu}2{beta} decays. The associated half-lives are computed and particular attention is devoted to the study of the detectability of the resonant neutrinoless double electron capture (R0{nu}ECEC) process in {sup 106}Cd. The calculations of the present article constitute the thus far most complete and up-to-date investigation of the double-beta-decay properties of {sup 106}Cd.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗