Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Eigenvalue algorithm”

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 109 records · Page 6

GPU-Accelerated Solution of the Bethe–Salpeter Equation for Large and Heterogeneous Systems

We present a massively parallel GPU-accelerated implementation of the Bethe–Salpeter equation (BSE) for the calculation of the vertical excitation energies (VEEs) and optical absorption spectra of condensed and molecular systems, starting from single-particle eigenvalues and eigenvectors obtained with density functional theory. The algorithms adopted here circumvent the slowly converging sums over empty and occupied states and the inversion of large dielectric matrices through a density matrix perturbation theory approach and a low-rank decomposition of the screened Coulomb interaction, respectively. Further computational savings are achieved by exploiting the nearsightedness of the density matrix of semiconductors and insulators to reduce the number of screened Coulomb integrals. We scale our calculations to thousands of GPUs with a hierarchical loop and data distribution strategy. The efficacy of our method is demonstrated by computing the VEEs of several spin defects in wide-band-gap materials, showing that supercells with up to 1000 atoms are necessary to obtain converged results. We discuss the validity of the common approximation that solves the BSE with truncated sums over empty and occupied states. In conclusion, we then apply our GW-BSE implementation to a diamond lattice with 1727 atoms to study the symmetry breaking of triplet states caused by the interaction of a point defect with an extended line defect.

Absorption spectra

An eigenvalue/eigenvector assignment algorithm using output feedback

An eigenvalue/eigenvector assignment algorithm using stationary output feedback is presented. The algorithm permits assignment of min (n, m + r - 1) eigenvalues and max (m-1, r-1) eigenvectors, where n, m, r refer to the system state, input and output dimensions, respectively. An example is given to illustrate the design procedures.

Mielke, R. R.

A parallel householder tridiagonalization stratagem using scattered row decomposition

Householder's method for tridiagonalizing a real symmetric matrix, a major step in evaluating eigenvalues of the matrix, is modified into a parallel algorithm for a concurrent machine of message passing type. Each processor of the concurrent machine has its own CPU, communications control and local memory. Messages are passed through connections between processors. Although the basic algorithm is inherently serial, the computations can be spread over all processors by scattering different rows of the matrix into processors, hence the term 'Scattered Row Decomposition'. The steps in the serial and the parallel algorithms are identified. Expressions for efficiency and speedup are given in terms of problem and machine parameters. For a concurrent machine of ring type interconnection, a selected representative problem of large order exhibits efficiency approaching 66 per cent.

Chang, H. Y.

Solution and sensitivity analysis of a complex transcendental eigenproblem with pairs of real eigenvalues

This paper considers complex transcendental eigenvalue problems where one is interested in pairs of eigenvalues that are restricted to take real values only. Such eigenvalue problems arise in dynamic stability analysis of nonconservative physical systems, i.e., flutter analysis of aeroelastic systems. Some available solution methods are discussed and a new method is presented. Two computational approaches are described for analytical evaluation of the sensitivities of these eigenvalues when they are dependent on other parameters. The algorithms presented are illustrated through examples.

Murthy, Durbha V.

Solution and sensitivity analysis of a complex transcendental eigenproblem with pairs of real eigenvalues

This paper considers complex transcendental eigenvalue problems where one is interested in pairs of eigenvalues that are restricted to take real values only. Such eigenvalue problems arise in dynamic stability analysis of nonconservative physical systems, i.e., flutter analysis of aeroelastic systems. Some available solution methods are discussed and a new method is presented. Two computational approaches are described for analytical evaluation of the sensitivities of these eigenvalues when they are dependent on other parameters. The algorithms presented are illustrated through examples.

Murthy, D. V.

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry

Full and reduced order observer based controller design for H2-optimization

The most general H2 control problem is considered. The authors derive necessary and sufficient conditions when the infimum is attained by state feedback. They do the same for the measurement feedback case where necessary and sufficient conditions are derived when the infimum is attained by proper dynamic compensator. Reduced-order compensators are investigated if some states are observable without noise. For all of these cases the freedom that the non-uniqueness of optimal compensators gives in assigning the closed-loop eigenvalues is discussed. The case when the infimum cannot be attained is investigated. A constructive algorithm is presented to find a minimizing sequence of stabilizing controllers and the freedom in the asymptotic locations of the closed-loop eigenvalues is discussed. This procedure is repeated for three different cases: static state feedback, full-order measurement feedback, and reduced-order measurement feedback.

Stoorvogel, Anton A.

Genetic Optimization of a Tensegrity Structure

Marshall Space Flight Center (MSFC) is charged with developing advanced technologies for space telescopes. The next generation of space optics will be very large and lightweight. Tensegrity structures are built of compressive members (bars), and tensile members (strings). For most materials, the tensile strength of a longitudinal member is larger than its buckling strength; therefore a large stiffness to mass ratio can be achieved by increasing the use of tensile members. Tensegrities are the epitome of lightweight structures, since they take advantage of the larger tensile strength of materials. The compressive members of tensegrity structures are disjoint allowing compact storage of the structure. The structure has the potential to eliminate the requirement for assembly by man in space; it can be deployed by adjustments in its cable tension. A tensegrity structure can be more reliably modeled since none of the individual members experience bending moments. (Members that experience deformation in more than one dimension are much harder to model.) Structures that can be more precisely modeled can be more precisely controlled. Furthermore, an astoundingly wide variety of natural systems, including carbon atoms, water molecules, proteins, viruses, cells, tissues and even human and other living creatures are tensegrity structures. Through the process of evolution, nature continually improves the design of living creatures for the environment they live in. Since tensegrities are nature's structure of choice, it is conceivable that they have other benefits we are unaware of. A. Keane and S. Brown designed a satellite boom truss system with an enhanced vibration performance. They started with a standard truss system, then used a genetic algorithm to alter the design, while optimizing the vibration performance. An improvement of over 20,000% in frequency-averaged energy levels was obtained using this approach. In this report an introduction to tensegrity structures is given, along with a description of how to generate the nodal coordinates and connectivity of a multiple stage cylindrical tensegrity structure. A description of how finite elements can be used to develop a stiffness and mass matrix so that the modes of vibration can be determined from the eigenvalue problem is shown. A brief description of a micro genetic algorithm is then presented.

Jaime R. Taylor

An O(N squared) method for computing the eigensystem of N by N symmetric tridiagonal matrices by the divide and conquer approach

An efficient method is proposed to solve the eigenproblem of N by N Symmetric Tridiagonal (ST) matrices. Unlike the standard eigensolvers which necessitate O(N cubed) operations to compute the eigenvectors of such ST matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N squared) operations. The method is based on serial implementation of the recently introduced Divide and Conquer (DC) algorithm. It exploits the fact that by O(N squared) of DC operations, one can compute the eigenvalues of N by N ST matrix and a finite number of pairs of successive rows of its eigenvector matrix. The rest of the eigenvectors--all of them or one at a time--are computed by linear three-term recurrence relations. Numerical examples are presented which demonstrate the superiority of the proposed method by saving an order of magnitude in execution time at the expense of sacrificing a few orders of accuracy.

Gill, Doron

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE

Controlled gate networks: theory and application to eigenvalue estimation

We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.

Bee-Lindgren, Max [Georgia Institute of Technology

Design of reduced-order state estimators for linear time-varying multivariable systems

The design of reduced-order state estimators for linear time-varying multivariable systems is considered. Employing the concepts of matrix operators and the method of canonical transformations, this paper shows that there exists a reduced-order state estimator for linear time-varying systems that are 'lexicography-fixedly observable'. In addition, the eigenvalues of the estimator can be arbitrarily assigned. A simple algorithm is proposed for the design of the state estimator.

Nguyen, Charles C.

Application of spectral collocation techniques to the stability of swirling flows

The linearized stability equations in cylindrical coordinates of a Chebyshev spectral collocation method for the temporal and spatial stability of swirling flows are presently solved with the eigenvalues obtained through the use of the QZ routine. The algorithm thus created is robust and easily adaptable to a range of flow configurations encompassing internal and external flows with minor boundary condition application modifications. Accuracy and efficiency tests of the method are made for the cases of plane Poiseulle, rotating-pipe, and trailing line vortex flows.

Khorrami, Mehdi R.

Modeling the spatiotemporal organization of velocity storage in the vestibuloocular reflex by optokinetic studies

1. A generalized three-dimensional state space model of visual vestibular interaction was developed. Matrix and dynamical system operators associated with inputs from the semicircular canals, otolith velocity estimator, and the visual system have been incorporated into the model, which focus on their relationship to the velocity storage integrator. 2. A relationship was postulated between the eigenvalues and the direction of the eigenvectors of the system matrix and the orientation of the spatial vertical. It was assumed that the system matrix for a tilted position was a composition of two linear transformations of the system matrix for the upright position. One transformation modifies the eigenvalues of the system matrix, whereas another rotates the eigenvectors of the system matrix. The pitch and roll eigenvectors rotate with the head, whereas the yaw axis eigenvector remains approximately spatially invariant. 3. Based on the three-dimensional model, a computational procedure was formulated to identify the eigenvalues and eigenvectors of the system matrix with the use of a modification of the marquardt algorithm. With the use of data obtained from a monkey, it was shown that the three-dimensional behavior of velocity storage cannot be predicted solely in terms of its time constants, i.e., the inverse of its eigenvalues. With the use of the same eigenvalues the data could either be fit or not fit, depending on the eigenvector directions. Therefore, it is necessary to specify eigenvector directions when characterizing velocity storage in three dimensions. 4. Parameters found with the use of the Marquardt algorithm were incorporated into the model. Diagonal matrices in a head coordinate frame were introduced for coupling the visual system to the integrator and to the direct optokinetic pathway. Simulations of optokinetic nystagmus (OKN) and optokinetic after-nystagmus (OKAN) were run. The model predicted the behavior of yaw and pitch OKN and OKAN when the animal is upright. It also predicted the cross-coupling in the side down position. The trajectories in velocity space were also accurately simulated. 5. One of the predictions of the model is that when the stimulus direction is along an eigenvector, the trajectory in velocity space is a straight line. Using the "spectral width" of the residuals from a straight line sequence during OKAN, we developed a methodology to estimate how close the OKAN decay was to an eigenvector trajectory. 6. Thus we have developed a model-based approach for studying and interpreting the response characteristics of velocity storage in three dimensions.(ABSTRACT TRUNCATED AT 400 WORDS).

Non-NASA Center

INVESTIGATING THE FEASIBILITY AND STABILITY FOR MODELING ACOUSTIC WAVE SCATTERING USING A TIME-DOMAIN BOUNDARY INTEGRAL EQUATION WITH IMPEDANCE BOUNDARY CONDITION

Reducing aircraft noise is a major objective in the field of computational aeroacoustics. When designing next generation quiet and environmentally friendly aircraft, it is important to be able to accurately and efficiently predict the acoustic scattering by an aircraft body from a given noise source. Acoustic liners are an effective tool for aircraft noise reduction and are characterized by a frequency-dependent impedance. Converted into the time-domain using Fourier transforms, an impedance boundary condition can be used to simulate the acoustic wave scattering by geometric bodies treated with acoustic liners. This work considers using either an impedance or an admittance (inverse of impedance) boundary condition to allow for acoustic scattering problems to be modeled with geometries consisting of both un-lined and lined surfaces. Three acoustic liner models are discussed: the Extended Helmholtz Resonator Model, the Three-Parameter Impedance Model, and the Broadband Impedance Model. In both the Helmholtz and Three-Parameter models, liner impedance is specified at a given frequency, whereas the Broadband model allows for the investigation of multiple frequencies simultaneously. The impedance and admittance boundary conditions for acoustic liners are derived for each model and coupled with a time-domain boundary integral equation. The scattering solution is obtained iteratively using a boundary element method with constant spatial and third-order temporal basis functions. Time-domain boundary integral equations are unfortunately prone to numerical instabilities due to resonant frequencies resulting from non-trivial solutions in the interior domain. When reformulated with the Burton-Miller method, the instabilities are eliminated. Using a Burton-Miller reformulation, the stability of the boundary element method assuming a liner boundary condition is assessed using eigenvalue analysis. The stability of each liner model is discussed, and it is shown that the Three-Parameter and Broadband models are sufficient for modeling an acoustic liner on the surface of scattering bodies. The Helmholtz model demonstrates strict limitations for stability, whereas the Three-Parameter and Broadband models are stable for most cases. Also included in this work is an assessment of the spatial accuracy of the time-domain boundary element method with respect to the surface element basis functions, as well as a performance study of the numerical algorithm.

computational mathematics

Stochastic noise can be helpful for variational quantum algorithms

Saddle points constitute a crucial challenge for first-order gradient descent algorithms. In notions of classical machine learning, they are avoided, for example, by means of stochastic gradient descent methods. In this work, we provide evidence that the saddle-points problem can be naturally avoided in variational quantum algorithms by exploiting the presence of stochasticity. We prove convergence guarantees and present practical examples in numerical simulations and on quantum hardware. We argue that the natural stochasticity of variational algorithms can be beneficial for avoiding strict saddle points, i.e., those saddle points with at least one negative Hessian eigenvalue. This insight that some levels of shot noise could help is expected to add a new perspective to notions of near-term variational quantum algorithms. Published by the American Physical Society 2025

Liu, Junyu