SEARCH · Search NASA

Results for “Exponential 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Data-Driven Refinement of Electronic Energies from Two-Electron Reduced-Density-Matrix Theory

The exponential computational cost of describing strongly correlated electrons can be mitigated by adopting a reduced-density-matrix (RDM)-based description of the electronic structure. While variational two-electron RDM (v2RDM) methods can enable large-scale calculations on such systems, the quality of the solution is limited by the fact that only a subset of known necessary N-representability constraints can be applied to the 2RDM in practical calculations. Here, we demonstrate that violations of partial three-particle (T1 and T2) N-representability conditions, which can be evaluated with knowledge of only the 2RDM, can serve as physics-based features in a machine-learning (ML) protocol for improving energies from v2RDM calculations that consider only two-particle (PQG) conditions. Proof-of-principle calculations demonstrate that the model yields substantially improved energies, relative to reference values from configuration-interaction-based calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

DOE OSTI2020

Calculating the divided differences of the exponential function by addition and removal of inputs

We introduce a method for calculating the divided differences of the exponential function by means of addition and removal of items from the input list to the function. Our technique exploits a new identity related to divided differences recently derived by F. Zivcovich. We show that upon adding an item to or removing an item from the input list of an already evaluated exponential, the re-evaluation of the divided differences can be done with only O(sn) floating point operations and O(sn) bytes of memory, where [z 0 ,...,z n ] are the inputs and s ∝ max i,j |z i – z j |. We demonstrate our algorithm’s ability to deal with input lists that are orders-of-magnitude longer than the maximal capacities of the current state-of-the-art. Here, we discuss in detail one practical application of our method: the efficient calculation of weights in the off-diagonal series expansion quantum Monte Carlo algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform↗

DOE OSTI2011

Multi-Reactor Transmutation Analysis Utility (MRTAU,alpha1): Verification

Multi-Reactor Transmutation Utility (MRTAU) is a general depletion/decay algorithm under development at INL to support quick assessment of off-normal fuel cycle scenarios of similar nature to well studied reactor and fuel cycle concepts for which isotopic and cross-section data exists. MRTAU has been used in the past for scoping calculations to determine actinide composition evolution over the course of multiple recycles in Light Water Reactor Mixed Oxide and Sodium cooled Fast Reactor. In these applications, various actinide partitioning scenarios of interest were considered. The code has recently been expanded to include fission product generation, depletion and isotopic evolution over multiple recycles. The capability was added to investigate potential partial separations and/or limited recycling technologies such as Melt-Refining, AIROX, DUPIC or other fuel recycle technology where the recycled fuel stream is not completely decontaminated of fission products prior to being re-irradiated in a subsequent reactor pass. This report documents the code's solution methodology and algorithm as well as its solution accuracy compared to the SCALE6.0 software suite.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2014

A Compact Formula for Rotations as Spin Matrix Polynomials

Group elements of SU(2) are expressed in closed form as finite polynomials of the Lie algebra generators, for all definite spin representations of the rotation group. Here, the simple explicit result exhibits connections between group theory, combinatorics, and Fourier analysis, especially in the large spin limit. Salient intuitive features of the formula are illustrated and discussed.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Revisiting stochastic variability of AGNs with structure functions

Discrepancies between reported structure function (SF) slopes and their overall flatness as compared to the expectations from the damped random walk (DRW) model, which generally well describes the variability of active galactic nuclei (AGNs), have triggered us to study this problem in detail. We review common AGN variability observables and identify their most common problems. Equipped with this knowledge, we study ∼9000 r-band AGN light curves from Stripe 82 of the Sloan Digital Sky Survey, using SFs described by stochastic processes with the power exponential covariance matrix of the signal. We model the “subensemble” SFs in the redshift–absolute magnitude bins with the full SF equation (including the turnover and the noise part) and a single power law (SPL; in the “red noise regime” after subtracting the noise term). The distribution of full-equation SF (SPL) slopes peaks at γ=0.55±0.08 (0.52 ± 0.06) and is consistent with the DRW model. There is a hint of a weak correlation of γ with the luminosity and a lack of correlation with the black hole mass. The typical decorrelation timescale in the optical is τ=0.97±0.46 year. The SF amplitude at one year obtained from the SPL fitting is SF{sub 0}=0.22±0.06 mag and is overestimated because the SF is already at the turnover part, so the true value is SF{sub 0}=0.20±0.06 mag. The asymptotic variability is SF{sub ∞}=0.25±0.06 mag. It is strongly anticorrelated with both the luminosity and the Eddington ratio and is correlated with the black hole mass. The reliability of these results is fortified with Monte Carlo simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1979

The adiabatic semiclassical perturbation theory for vibrationally inelastic scattering. I - Collinear calculations. II - Three-dimensional treatment

A semiclassical approximation to treat vibrationally inelastic scattering is developed. The vibrational basis set used is adiabatic with respect to a reference potential which is chosen to be as close as possible to the true potential and also gives easily obtainable solutions to the vibrational wave equation. The radial wave functions are obtained using the WKB approximation, and the coupled Schroedinger equations are solved by a first-order perturbation method to yield a phase shift matrix which is exponentiated to give the full scattering matrix. Results were obtained for all the cases computed by Secrest and Johnson and by Clark and Dickinson, and the agreement is better than 10% for half of the cross-sections and rarely off by more than a factor of 2.

Cross, R. J., Jr.↗

NASA NTRS2013

Refinement of the Robert-Bonamy Formalism: Considering Effects from the Line Coupling

Since it was developed in 1979, the Robert-Bonamy (RB) formalism has been widely used in calculating pressure broadened half-widths and induced shifts for many molecular systems. However, this formalism contains several approximations whose applicability has not been thoroughly justified. One of them is that lines of interest are well isolated. When these authors developed the formalism, they have relied on this assumption twice. First, in calculating the spectral density F(ω), they have only considered the diagonal matrix elements of the relaxation operator. Due to this simplification, effects from the line mixing are ignored. Second, when they applied the linked cluster theorem to remove the cutoff, they have assumed the matrix elements of the operator exp(-iS(sub 1) - S(sub 2)) can be replaced by the exponential of the matrix elements of -iS(sub 1) - S(sub 2). With this replacement, effects from the line coupling are also ignored. Although both these two simplifications relied on the same approximation, their validity criteria are completely different and the latter is more stringent than the former. As a result, in many cases where the line mixing becomes negligible, significant effects from the line coupling have been completely missed. In the present study, we have developed a new method to evaluate the matrix elements of exp(-iS(sub 1) - S(sub 2)) and have refined the RB formalism such that line coupling can be taken into account. Our numerical calculations of the half-widths for Raman Q lines of the N(sub 2)-N(sub 2) pair have demonstrated that effects from the line coupling are important. In comparison with values derived from the RB formalism, new calculated values for these lines are significantly reduced. A recent study has shown that in comparison with the measurements and the most accurate close coupling calculations, the RB formalism overestimates the half-widths by a large amount. As a result, the refinement of the RB formalism goes in the right direction and these new calculated half-widths become closer to the "true" values.

spectra↗

DOE OSTI2011

Tkachenko modes and their damping in the vortex lattice regime of rapidly rotating bosons

We have found an exact analytical solution of the Bogoliubov-de Gennes equations for the Tkachenko modes of the vortex lattice in the lowest Landau level (LLL) in the thermodynamic limit (geometry of an infinite plane) at any momenta and calculated their damping rates. At finite temperatures both Beliaev and Landau damping leads to momentum-independent damping rates in the low-energy limit, which shows that, at sufficiently low energies, Tkachenko modes become strongly damped. We then found that the mean-square fluctuations of the density grow logarithmically at large distances, which indicates that the state is ordered in the vortex lattice only on a finite (although exponentially large) distance scale and introduces a low-momentum cutoff. Using this circumstance we showed that at finite temperatures the one-body density matrix undergoes an exponential decay at large distances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Combining DPG in space with DPG time-marching scheme for the transient advection–reaction equation

In this article, we present a general methodology to combine the Discontinuous Petrov–Galerkin (DPG) method in space and time in the context of methods of lines for transient advection–reaction problems. We first introduce a semidiscretization in space with a DPG method redefining the ideas of optimal testing and practicality of the method in this context. Then, we apply the recently developed DPG-based time-marching scheme, which is of exponential-type, to the resulting system of Ordinary Differential Equations (ODEs). Further, we also discuss how to efficiently compute the action of the exponential of the matrix coming from the space semidiscretization without assembling the full matrix. Finally, we verify the proposed method for 1D+time advection–reaction problems showing optimal convergence rates for smooth solutions and more stable results for linear conservation laws comparing to the classical exponential integrators.

42 ENGINEERING↗

DOE OSTI2022

Combining DPG in space with DPG time-marching scheme for the transient advection-reaction equation

In this article, we present a general methodology to combine the Discontinuous PetrovGalerkin (DPG) method in space and time in the context of methods of lines for transient advection-reaction problems. We first introduce a semidiscretization in space with a DPG method redefining the ideas of optimal testing and practicality of the method in this context. Then, we apply the recently developed DPG-based time-marching scheme, which is of exponential-type, to the resulting system of Ordinary Differential Equations (ODEs). We also discuss how to efficiently compute the action of the exponential of the matrix coming from the space semidiscretization without assembling the full matrix. Finally, we verify the proposed method for 1D+time advection-reaction problems showing optimal convergence rates for smooth solutions and more stable results for linear conservation laws comparing to the classical exponential integrators.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Real time time-dependent density functional theory using higher order finite-element methods

We present a computationally efficient approach to solve the time-dependent Kohn-Sham equations in real time using higher order finite-element spatial discretization, applicable to both pseudopotential and all-electron calculations. To this end, we develop an a priori mesh adaption technique, based on the semidiscrete (discrete in space but continuous in time) error estimate on the time-dependent Kohn-Sham orbitals, to construct an efficient finite-element discretization. Subsequently, we obtain the full-discrete error estimate to guide our choice of the time step. We employ spectral finite elements along with special reduced order quadrature to render the overlap matrix diagonal, thereby simplifying the inversion of the overlap matrix that features in the evaluation of the discrete time-evolution operator. We use the second-order Magnus operator as the time-evolution operator, wherein the action of the discrete Magnus operator, expressed as exponential of a matrix, on the Kohn-Sham orbitals is obtained efficiently through an adaptive Lanczos iteration. We observe close to optimal rates of convergence of the dipole moment with respect to spatial and temporal discretization, for both pseudopotential and all-electron calculations. We demonstrate a staggering 100-fold reduction in the computational time afforded by higher order finite elements over linear finite elements, for both pseudopotential and all-electron calculations. Further, for similar level of accuracy, we obtain significant computational savings by our approach as compared to state-of-the-art finite-difference methods. Here, we also demonstrate the competence of higher order finite elements for all-electron benchmark systems. Lastly, we observe good parallel scalability of the proposed method on many hundreds of processors.

36 MATERIALS SCIENCE↗

DOE OSTI2019

Real-time density-matrix coupled-cluster approach for closed and open systems at finite temperature

We extend the coupled-cluster method to correlated quantum dynamics of both closed and open systems at finite temperatures using the thermofield formalism. The approach expresses the time-dependent density matrix in an exponential ansatz and describes time-evolution along the Keldysh path contour. A distinct advantage of the approach is exact trace-preservation as a function of time, ensuring conservation of probability and particle number. Furthermore, the method avoids the computation of correlated bra-states, simplifying the computational implementation. We develop the method in a thermal quasiparticle representation, which allows seamless connection to the projection method and diagrammatic techniques of the traditional coupled-cluster formalism. For comparison, we also apply the thermofield framework to the density-matrix renormalization-group method to obtain reference results for closed and open systems at finite temperature. We test the singles and doubles approximation to the density-matrix coupled-cluster method on the correlated electronic dynamics of the single-impurity Anderson model, demonstrating that the new method successfully captures the correlated dynamics of both closed systems at finite temperature and driven-dissipative open systems. This encouraging performance motivates future applications to nonequilibrium quantum many-body dynamics in realistic systems.

Shushkov, Philip (ORCID:0000000266136117)↗

DOE OSTI2021

Inversion of dynamical Bragg intensities to complex structure factors by iterated projections. For Ultramic. 2020. ("Pico" Festschrift, May 2021)

We discuss a method for recovering complex structure factors from many simultaneously excited Bragg beam intensities is described. The method is applied to simulated transmission electron diffraction data over a wide range of crystal thickness and beam energies. The method is based on iterated projections between structure and scattering matrices, which are related by a matrix unitary transformation, exponential, which we invert. The algorithm removes multiple-scattering perturbations from diffraction data and might be extended to other fields, including X-ray and neutron diffraction and cryo-electron microscopy. Because coherent multiple scattering involves interference between Bragg beams, the method also solves the phase problem. Unlike dynamical inversion from electron microscope images or ptychography data, the method, which starts with Bragg beam intensities, provides complex structure factors unaffected by focusing errors or resolution limitations imposed by lenses. We provide inversions from simulated data with 441 simultaneously excited Bragg beams over a range of thickness and beam energy. We discuss the retrieval of chirality information from enantiomorphs, the efficient incorporation of symmetry information using the irreducible representation of the group of structure matrices, and the effect of HOLZ lines to provide three-dimensional information.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Quasiprobabilistic Readout Correction of Midcircuit Measurements for Adaptive Feedback via Measurement Randomized Compiling

Quantum measurements are a fundamental component of quantum computing. However, on present-day quantum computers, measurements can be more error prone than quantum gates and are susceptible to nonunital errors as well as nonlocal correlations due to measurement crosstalk. While readout errors can be mitigated in postprocessing, this is inefficient in the number of qubits due to a combinatorially large number of possible states that need to be characterized. In this work, we show that measurement errors can be tailored into a simple stochastic error model using randomized compiling, enabling the efficient mitigation of readout errors via quasiprobability distributions reconstructed from the measurement of a single preparation state in an exponentially large confusion matrix. We demonstrate the scalability and power of this approach by correcting readout errors without matrix inversion on a large number of different preparation states applied to a register of eight superconducting transmon qubits. Moreover, we show that this method can be extended to midcircuit measurements used for active feedback via quasiprobabilistic error cancellation, and we demonstrate the correction of measurement errors on an ancilla qubit used to detect and actively correct bit-flip errors on an entangled memory qubit. Our approach enables the correction of readout errors on large numbers of qubits and offers a strategy for correcting readout errors in adaptive circuits in which the results of midcircuit measurements are used to perform conditional operations on nonlocal qubits in real time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2019

Parallel-In-Time Magnus Integrators

Magnus integrators are a subset of geometric integration methods for the numerical solution of ordinary differential equations that conserve certain invariants in the numerical solution. Our report explores temporal parallelism of Magnus integrators, particularly in the context of nonlinear problems. The method combines the concurrent computation of matrix commutators and exponentials within a time step with a pipelined iteration applied to multiple time steps in parallel. The accuracy and efficiency of time parallel Magnus methods up to order six are highlighted through numerical examples and demonstrate that critical parallel speedup is possible compared to serial methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

Posterior propriety for hierarchical models with log-likelihoods that have norm bounds

Statisticians often use improper priors to express ignorance or to provide good frequency properties, requiring that posterior propriety be verified. Our paper addresses generalized linear mixed models, GLMMs, when Level I parameters have Normal distributions, with many commonly-used hyperpriors. It provides easy-to-verify sufficient posterior propriety conditions based on dimensions, matrix ranks, and exponentiated norm bounds, ENBs, for the Level I likelihood. Since many familiar likelihoods have ENBs, which is often verifiable via log-concavity and MLE finiteness, our novel use of ENBs permits unification of posterior propriety results and posterior MGF/moment results for many useful Level I distributions, including those commonly used with multilevel generalized linear models, e.g., GLMMs and hierarchical generalized linear models, HGLMs. Furthermore, those who need to verify existence of posterior distributions or of posterior MGFs/moments for a multilevel generalized linear model given a proper or improper multivariate F prior as in Section 1 should find the required results in Sections 1 and 2 and Theorem 3 (GLMMs), Theorem 4 (HGLMs), or Theorem 5 (posterior MGFs/moments).

97 MATHEMATICS AND COMPUTING↗