Search NASA⌕ Search

SEARCH · Search NASA

Results for “Matrix exponential”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Numerical methods for the analysis of sampled-data systems and for the computation of system zeros

MARSYAS is a computer aided control system design package for the simulation and analysis of open loop and closed loop dynamic systems. Outlined here is the numerical and theoretical basis of the MARSYAS functions developed during the summer of 1991. In particular, the numerical computation of the matrix exponential e(exp A) = I + A + A(exp 2)/2! + A(exp 3)/3! + ... and the numerical computation of the finite system zeros of a dynamic system (continuous time or discrete time) are presented.

Hodel, A. Scottedward↗
NASA NTRS1993

Programs Help Create And Evaluate Markov Models

Pade Approximation With Scaling (PAWS) and Scaled Taylor Exponential Matrix (STEM) computer programs provide flexible, user-friendly, language-based interface for creation and evaluation of Markov models describing behaviors of fault-tolerant reconfigurable computer systems. Produce exact solution for probabilities of system failures and provide conservative estimates of numbers of significant digits in solutions. Also offer as part of bundled package with SURE and ASSIST, two other reliable analysis programs developed by Systems Validation Methods group at Langley Research Center.

Butler, Ricky W.↗
NASA NTRS1993

Exact methods for modal transient response analysis including feedback control

This paper presents a modal method for the analysis of controlled structural systems that retains the uncoupled nature of the classical transient response analysis of a structure subjected to a prescribed time-varying load. The control force is expanded as a Taylor series that remains on the right side of the equations, and it does not lead to a computational approach that requires coupling between modes on the left side. Retaining a sufficient number of terms in the series produces a solution to the modal equations that is accurate to machine precision. The approach is particularly attractive for large problems in which standard matrix exponential methods become computationally prohibitive. Numerical results are presented to show the accuracy and efficiency of the proposed approach for dynamic feedback compensation of a truss structure with local member modes in the controller bandwidth.

Anderson, Melvin S.↗
NASA NTRS1992

A reliable algorithm for optimal control synthesis

In recent years, powerful design tools for linear time-invariant multivariable control systems have been developed based on direct parameter optimization. In this report, an algorithm for reliable optimal control synthesis using parameter optimization is presented. Specifically, a robust numerical algorithm is developed for the evaluation of the H(sup 2)-like cost functional and its gradients with respect to the controller design parameters. The method is specifically designed to handle defective degenerate systems and is based on the well-known Pade series approximation of the matrix exponential. Numerical test problems in control synthesis for simple mechanical systems and for a flexible structure with densely packed modes illustrate positively the reliability of this method when compared to a method based on diagonalization. Several types of cost functions have been considered: a cost function for robust control consisting of a linear combination of quadratic objectives for deterministic and random disturbances, and one representing an upper bound on the quadratic objective for worst case initial conditions. Finally, a framework for multivariable control synthesis has been developed combining the concept of closed-loop transfer recovery with numerical parameter optimization. The procedure enables designers to synthesize not only observer-based controllers but also controllers of arbitrary order and structure. Numerical design solutions rely heavily on the robust algorithm due to the high order of the synthesis model and the presence of near-overlapping modes. The design approach is successfully applied to the design of a high-bandwidth control system for a rotorcraft.

Vansteenwyk, Brett↗
NASA NTRS2002

Human motion planning based on recursive dynamics and optimal control techniques

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Non-NASA Center↗
NASA NTRS2020

Electromagnetic Scattering by Discrete Random Media Illuminated by a Gaussian Beam II: Solution of the Radiative Transfer Equation

In this paper, we present numerical methods for solving the phenomenological scalar radiative transfer equation for a discrete random medium illuminated by a Gaussian beam. These rely on the Fourier transform method for the horizontal variables and the discrete ordinate method with matrix exponential for solving the underlying one-dimensional radiative transfer equation in the wavenumber domain. The problem of a Gaussian beam at oblique and normal incidence, as well as, the searchlight problem are treated. A complete description of the methods and the numerical algorithms is provided.

Gaussian beam↗
DOE OSTI2021

Exponential Time Differencing Schemes for Fuel Depletion and Transport in Molten Salt Reactors: Theory and Implementation

A numerical framework for modeling depletion and mass transport in liquid-fueled molten salt reactions is presented based on exponential time differencing. The solution method involves using the finite volume method to transform the system of partial differential equations (PDEs) into a much larger system of ordinary differential equations. The key part of this method involves solving for the exponential of a matrix. We explore six different algorithms to compute the exponential in a series of progression problems that explore physical transport phenomena in molten salt reactors. This framework shows good results for solving linear parabolic PDEs with each of the six matrix exponential algorithms. For large problems, the series solvers such as Padé and Taylor have large run times, which can be mitigated by using the Krylov subspace.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
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↗
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 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 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↗