Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix”

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 937 records · Page 52

Long-range density-matrix-functional theory: Application to a modified homogeneous electron gas

We propose a method that employs functionals of the one-electron reduced density matrix (density matrix) to capture long-range effects of electron correlation. The complementary short-range regime is treated with density functionals. In an effort to find approximations for the long-range density-matrix functional, a modified power functional is applied to the homogeneous electron gas with Coulomb interactions replaced by their corresponding long-range counterparts. For the power {beta}=1/2 and the range-separation parameter {omega}=1/r{sub s}, the functional reproduces the correlation and the kinetic correlation energies with a remarkable accuracy for intermediate and large values of r{sub s}. Analysis of the Euler equation corresponding to this functional reveals correct r{sub s} expansion of the correlation energy in the limit of large r{sub s}. The first expansion coefficient is in very good agreement with that obtained from the modified Wigner-Seitz model.

74 ATOMIC AND MOLECULAR PHYSICS↗

Statistical properties of random matrix product states

We study the set of random matrix product states (RMPS) introduced by Garnerone, de Oliveira, and Zanardi [S. Garnerone, T. R. de Oliveira, and P. Zanardi, Phys. Rev. A 81, 032336 (2010)] as a tool to explore foundational aspects of quantum statistical mechanics. In the present work, we provide an accurate numerical and analytical investigation of the properties of RMPS. We calculate the average state of the ensemble in the nonhomogeneous case, and numerically check the validity of this result. We also suggest using RMPS as a tool to approximate properties of general quantum random states. The numerical simulations presented here support the accuracy and efficiency of this approximation. These results suggest that any generalized canonical state can be approximated with high probability by the reduced density matrix of a RMPS, if the average matrix product states coincide with the associated microcanonical ensemble.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combining density-functional theory and density-matrix-functional theory

We combine density-functional theory with density-matrix-functional theory to draw the best from both worlds. This is achieved by range separation of the electronic interaction which permits one to rigorously combine a short-range density functional with a long-range density-matrix functional. The short-range density functional is approximated by the short-range version of the Perdew-Burke-Ernzerhof functional (srPBE). The long-range density-matrix functional is approximated by the long-range version of the Buijse-Baerends functional (lrBB). The obtained srPBE+lrBB method accurately describes both the static and dynamic electron correlation at a computational cost similar to that of standard density-functional approximations. This is shown for the dissociation curves of the H{sub 2}, LiH, BH, and HF molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

Time-dependent occupation numbers in reduced-density-matrix-functional theory: Application to an interacting Landau-Zener model

We prove that if the two-body terms in the equation of motion for the one-body reduced density matrix are approximated by ground-state functionals, the eigenvalues of the one-body reduced density matrix (occupation numbers) remain constant in time. This deficiency is related to the inability of such an approximation to account for relative phases in the two-body reduced density matrix. We derive an exact differential equation giving the functional dependence of these phases in an interacting Landau-Zener model and study their behavior in short- and long-time regimes. The phases undergo resonances whenever the occupation numbers approach the boundaries of the interval [0,1]. In the long-time regime, the occupation numbers display correlation-induced oscillations and the memory dependence of the functionals assumes a simple form.

74 ATOMIC AND MOLECULAR PHYSICS↗

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↗

Encoding the structure of many-body localization with matrix product operators

Anderson insulators are noninteracting disordered systems which have localized single-particle eigenstates. The interacting analog of Anderson insulators are the many-body localized (MBL) phases. The spectrum of the many-body eigenstates of an Anderson insulator is efficiently represented as a set of product states over the single-particle modes. Here, we show that product states over matrix product operators of small bond dimension is the corresponding efficient description of the spectrum of an MBL insulator. In this language all of the many-body eigenstates are encoded by matrix product states (i.e., density matrix renormalization group wave functions) consisting of only two sets of low bond dimension matrices per site: the G i matrices corresponding to the local ground state on site i and the E i matrices corresponding to the local excited state. All 2 n eigenstates can be generated from all possible combinations of these sets of matrices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Relativistic entrainment matrix of a superfluid nucleon-hyperon mixture. II. Effect of finite temperatures

We calculate the important quantity of superfluid hydrodynamics, the relativistic entrainment matrix for a nucleon-hyperon mixture at arbitrary temperature. In the nonrelativistic limit this matrix is also termed the Andreev-Bashkin or mass-density matrix. Our results can be useful for modeling the pulsations of massive neutron stars with superfluid nucleon-hyperon cores and for studies of the kinetic properties of superfluid baryon matter.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dirac oscillators and the relativistic R matrix

The Dirac oscillators are shown to be an excellent expansion basis for solutions of the Dirac equation by R-matrix techniques. The combination of the Dirac oscillator and the R-matrix approach provides a convenient formalism for reactions as well as bound-state problems. The utility of the R-matrix approach is demonstrated in relativistic impulse approximation calculations where exchange terms can be calculated exactly and scattering waves made orthogonal to bound-state wave functions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Renormalization group equations for the CKM matrix

We derive the one loop renormalization group equations for the Cabibbo-Kobayashi-Maskawa (CKM) matrix for the standard model, its two Higgs extension, and the minimal supersymmetric extension in a novel way. The derived equations depend only on a subset of the model parameters of the renormalization group equations for the quark Yukawa couplings so the CKM matrix evolution cannot fully test the renormalization group evolution of the quark Yukawa couplings. From the derived equations we obtain the invariant of the renormalization group evolution for three models which is the angle {phi}{sub 2} of the unitarity triangle. For the special case of the standard model and its extensions with v{sub 1}{approx_equal}v{sub 2} we demonstrate that also the shape of the unitarity triangle and the Buras-Wolfenstein parameters {rho} and {eta} are conserved. The invariance of the angles of the unitarity triangle means that it is not possible to find a model in which the CKM matrix might have a simple, special form at asymptotic energies.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Local bulk S-matrix elements and conformal field theory singularities

We give a procedure for deriving certain bulk S-matrix elements from corresponding boundary correlators. These are computed in the plane-wave limit, via an explicit construction of certain boundary sources that give bulk wave packets. A critical role is played by a specific singular behavior of the Lorentzian boundary correlators. It is shown in examples how correlators derived from the bulk supergravity exhibit the appropriate singular structure, and reproduce the corresponding S-matrix elements. This construction thus provides a nontrivial test for whether a given boundary conformal field theory can reproduce bulk physics, and where it does, supplies a prescription to extract bulk S-matrix elements in the plane-wave limit.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Visual Matrix Clustering of Social Networks

The prevailing choices to graphically represent a social network in today’s literature are a node-link graph layout and an adjacency matrix. Both visualization techniques have unique strengths and weaknesses when applied to different domain applications. In this article, we focus our discussion on adjacency matrix and how to turn the matrix-based visualization technique from merely showing pairwise associations among network actors (or graph nodes) to depicting clusters of a social network. We also use node-link layouts to supplement the discussion.

graph analytics↗

Sample Complexity of Power System State Estimation Using Matrix Completion

In this paper, we propose an analytical framework to quantify the amount of data samples needed to obtain accurate state estimation in a power system - a problem known as sample complexity analysis in computer science. Motivated by the increasing adoption of distributed energy resources into the distribution-level grids, it becomes imperative to estimate the state of distribution grids in order to ensure stable operation. Traditional power system state estimation techniques mainly focus on the transmission network which involve solving an overdetermined system and eliminating bad data. However, distribution networks are typically underdetermined due to the large number of connection points and high cost of pervasive installation of measurement devices. In this paper, we consider the recently proposed state-estimation method for underdetermined systems that is based on matrix completion. In particular, a constrained matrix completion algorithm was proposed, wherein the standard matrix completion problem is augmented with additional equality constraints representing the physics (namely power-flow constraints). We analyze the sample complexity of this general method by proving an upper bound on the sample complexity that depends directly on the properties of these constraints that can lower number of needed samples as compared to the unconstrained problem. To demonstrate the improvement that the constraints add to state estimation, we test the method on a 141-bus distribution network case study and compare it to the traditional least squares minimization state estimation method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dynamic Matrix Completion Based State Estimation in Distribution Grids

The power distribution network is undergoing tremendous transformation due to an increase in the penetration of renewable energy resources and electric vehicles. These changes have resulted in greater uncertainty and dynamics in the distribution grid states. Therefore, the ability to track and monitor system states has become a critical need for accurate and timely control actions. In this paper, we propose two dynamic sparsity-based state estimation approaches for distribution systems: (1) locally weighted matrix completion (LW-MC) and (2) Bayesian matrix completion with Kalman filter prediction (BMC-KF). The performance of the proposed dynamic state estimation strategies is compared with the classic/static matrix completion (static-MC) approach using the IEEE 37 and IEEE 123 bus test systems. Finally, results indicate that BMC-KF approach outperforms both LW-MC as well as static-MC even when 30% of the measurement data is available. Computational complexity associated with both approaches is quantified.

42 ENGINEERING↗

Melting of nanocrystals embedded in a crystal matrix heated by nanosecond laser pulses

The kinetics of phase transformations of nanocrystals in a crystal matrix is considered upon non-stationary heating by laser pulses. The melting and crystallization kinetics of nanocrystals is described taking into account their size, shape, elemental composition, and elastic deformations appearing due to the mismatch of the lattice constants for nanocrystals and the matrix. The possibility of decreasing the dispersion of nanocrystals over their size in heterostructures with quantum dots is predicted. As an example, melting of Ge nanocrystals in a Si matrix is considered.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Deflation as a method of variance reduction for estimating the trace of a matrix inverse

Many fields require computing the trace of the inverse of a large, sparse matrix. The typical method used for such computations is the Hutchinson method which is a Monte Carlo (MC) averaging over matrix quadratures. To improve its convergence, several variance reductions techniques have been proposed. In this paper, we study the effects of deflating the near null singular value space. We make two main contributions. First, we analyze the variance of the Hutchinson method as a function of the deflated singular values and vectors. Although this provides good intuition in general, by assuming additionally that the singular vectors are random unitary matrices, we arrive at concise formulas for the deflated variance that include only the variance and mean of the singular values. We make the remarkable observation that deflation may increase variance for Hermitian matrices but not for non-Hermitian ones. This is a rare, if not unique, property where non-Hermitian matrices outperform Hermitian ones. The theory can be used as a model for predicting the benefits of deflation. Second, we use deflation in the context of a large scale application of "disconnected diagrams" in Lattice QCD. On lattices, Hierarchical Probing (HP) has previously provided an order of magnitude of variance reduction over MC by removing "error" from neighboring nodes of increasing distance in the lattice. Although deflation used directly on MC yields a limited improvement of 30% in our problem, when combined with HP they reduce variance by a factor of over 150 compared to MC. For this, we pre-computated 1000 smallest singular values of an ill-conditioned matrix of size 25 million. Furthermore, using PRIMME and a domain-specific Algebraic Multigrid preconditioner, we perform one of the largest eigenvalue computations in Lattice QCD at a fraction of the cost of our trace computation.

97 MATHEMATICS AND COMPUTING↗

Probing for the Trace Estimation of a Permuted Matrix Inverse Corresponding to a Lattice Displacement

We report thatpProbing is a general technique that is used to reduce the variance of the Hutchinson stochastic estimator for the trace of the inverse of a large, sparse matrix A. The variance of the estimator is the sum of the squares of the off-diagonal elements of A -1 . Therefore, this technique computes probing vectors that when used in the estimator annihilate the largest off-diagonal elements. For matrices that display decay of the magnitude of |A$^{-1}_{ij}$| with the graph distance between nodes i and j, this is achieved through graph coloring of increasing powers A k . Equivalently, when a matrix stems from a lattice discretization, it is computationally beneficial to find a distance-k coloring of the lattice. Previously, a hierarchical coloring was proposed so that k can be increased at runtime as needed without discarding previous work. In this work, we study probing for the more general problem of computing the trace of a permutation of A -1 , say PA -1 . The motivation comes from lattice quantum chromodynamics (QCD), where we need to construct “disconnected diagrams” to extract flavor-separated generalized parton functions. In lattice QCD, where the matrix has a four-dimensional toroidal lattice structure, these nonlocal operators correspond to a PA -1 , where P is the permutation relating to some displacement $\vec{p}$ in one or more dimensions. We focus on a single dimension displacement (p), but our methods are general. We show that probing on A k or (PA) k does not annihilate the largest magnitude elements. To resolve this issue, our displacement-based probing works on PA k using a new coloring scheme that works directly on appropriately displaced neighborhoods on the lattice. We prove lower bounds on the number of colors needed and study the effect of this scheme on variance reduction, both theoretically and experimentally on a real-world lattice QCD calculation. We achieve orders of magnitude speedup over the unprobed or the naively probed methods.

97 MATHEMATICS AND COMPUTING↗

Matrix-Free High-Performance Saddle-Point Solvers for High-Order Problems in \(\boldsymbol{H}(\operatorname{\textbf{div}})\)

Here, this work describes the development of matrix-free GPU-accelerated solvers for high-order finite element problems in H(div). The solvers are applicable to grad-div and Darcy problems in saddle-point formulation, and have applications in radiation diffusion and porous media flow problems, among others. Using the interpolation–histopolation basis, efficient matrix-free preconditioners can be constructed for the (1, 1)-block and Schur complement of the block system. With these approximations, block-preconditioned MINRES converges in a number of iterations that is independent of the mesh size and polynomial degree. The approximate Schur complement takes the form of an M-matrix graph Laplacian and therefore can be well-preconditioned by highly scalable algebraic multigrid methods. High-performance GPU-accelerated algorithms for all components of the solution algorithm are developed, discussed, and benchmarked. Numerical results are presented on a number of challenging test cases, including the “crooked pipe” grad-div problem, the SPE10 reservoir modeling benchmark problem, and a nonlinear radiation diffusion test case.

97 MATHEMATICS AND COMPUTING↗

T -matrix analysis of static Wilson line correlators from lattice QCD at finite temperature

Here, we utilize a previously constructed thermodynamic T -matrix approach to the quark-gluon plasma (QGP) to derive constaints on its input by using results on Wilson line correlators (WLCs) of a static quark-antiquark pair from 2 + 1-flavor lattice-QCD (lQCD) computations with realistic pion mass. The self-consistent T -matrix results, which include previous constraints from the lQCD equation of state in the light-parton sector, can describe the lQCD data for WLCs fairly well once refinements of its driving kernel are applied. In particular, the input potential requires less screening than what has been inferred from previous T-matrix analyses. Pertinent predictions for the spectral and transport properties of the QGP are discussed, including the spatial diffusion coefficient for heavy quarks; the latter turns out to have a rather weak temperature dependence, in approximate agreement with recent unquenched lQCD results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗