Search NASA⌕ Search

SEARCH · Search NASA

Results for “reduced eigenvalue problem”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Normal modes, rotational inertia, and thermal fluctuations of trapped ion crystals

The normal modes of a trapped ion crystal are derived using an approach based on the Hermitian properties of the system’s dynamical matrix. This method is equivalent to the standard Bogoliubov method, but for classical systems it is arguably simpler and more general in that canonical coordinates are not necessary. The theory is developed for stable, unstable, and neutrally-stable systems. The method is then applied to ion crystals in a Penning trap. Reduced eigenvalue problems for the case of large applied magnetic field are developed, for which the spectrum breaks into E x B drift modes, axial modes, and cyclotron modes. Thermal fluctuation levels in these modes are analyzed and shown to be consistent with the Bohr-van-Leeuwen theorem, provided that neutrally-stable modes associated with crystal rotations are included in the analysis. An expression for the rotational inertia of the crystal is derived, and a magnetic contribution to this inertia, which dominates in large magnetic fields, is described. An unusual limit is discovered for the special case of spherically-symmetric confinement, in which the rotational inertia does not exist and changes in angular momentum leave the rotation frequency unaffected.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Solving generalized eigenvalue problems by ordinary differential equations on a quantum computer

Many eigenvalue problems arising in practice are often of the generalized form A x = λ B x . One particularly important case is symmetric, namely A , B are Hermitian and B is positive definite. The standard algorithm for solving this class of eigenvalue problems is to reduce them to Hermitian eigenvalue problems. For a quantum computer, quantum phase estimation is a useful technique to solve Hermitian eigenvalue problems. In this work, we propose a new quantum algorithm for symmetric generalized eigenvalue problems using ordinary differential equations. The algorithm has lower complexity than the standard one based on quantum phase estimation. Moreover, it works for a wider case than symmetric: B is invertible, B - 1 A is diagonalizable and all the eigenvalues are real.

Science & Technology - Other Topics↗
DOE OSTI2019

Reduced-order modeling of parameterized multi-group diffusion k-eigenvalue problems

In this paper, a group-wise Reduced-Order Model, based on a Proper Orthogonal Decomposition (POD) technique, is presented for parameterized multi-group diffusion k-eigenvalue problems. The group-wise approach is shown to be more robust than model-order reduction based on monolithic multi-group POD modes. In addition, fewer POD modes are required. The method of snapshots is employed to generate the offline training set. Two Naïve and a Greedy snapshot-generation strategies are compared. The input parameter space is surveyed using Latin Hypercube Sampling techniques. The effectiveness of the group-wise model-order reduction method is demonstrated on two reactor-physics benchmarks, a two-group 3D Pressurized Water Reactor problem with 26 uncertain input parameters and a seven-group UO 2 -MOX fuel 3D mini-core with 287 uncertain input parameters. In both examples the Reduced-Order Models built using the snapshots generated by the Greedy algorithm proved to be slightly better. Model-order reduction yields results that are within 1 pcm of the full-order model, with speed-up factors of about 1000–3000, depending upon the test case.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Dimensionality reduction of the many-body problem using coupled-cluster subsystem flow equations: classical and quantum computing perspective

We discuss reduced-scaling strategies employing recently introduced sub-system embedding sub-algebras coupled-cluster formalism (SES-CC) to describe many-body systems. These strategies utilize properties of the SES-CC formulations where the equations describing certain classes of sub- systems can be integrated into a computational flows composed coupled eigenvalue problems of reduced dimensionality. Additionally, these flows can be defined at the level of the CC Ansatz defined by selected classes of cluster amplitudes, which define the wave function ”memory” of possible partitionings of the many-body system into constituent sub-systems. One of the possible ways of solving these coupled problems is through implementing procedures, where the information is passed between the sub-systems in a self-consistent manner. As a special case, we consider local flow formulations where the so-called local character of correlation effects can be closely related to properties of sub-system embedding sub-algebras employing localized molecular basis. We also generalize flow equations to the time domain and to downfolding methods utilizing double exponential unitary CC Ansatz (DUCC), where reduced dimensionality of constituent sub-problems offer a possibility of efficient utilization of limited quantum resources in modeling realistic systems.

Electron correlation, quantum chemistry, quantum c↗
DOE OSTI2020

A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation

The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world’s largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions that will be explored in future work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A Shift Selection Strategy for Parallel Shift-Invert Spectrum Slicing in Symmetric Self-Consistent Eigenvalue Computation

The central importance of large scale eigenvalue problems in scientific computation necessitates the development massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing excessive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions which will be explored in future work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Two-tier model reduction of viscoelastically damped finite element models

Transient simulations of linear viscoelastically damped structures necessitate critical computational resources to directly integrate the full-order finite element model with time-stepping algorithms. Traditional modal reduction techniques are not directly applicable to these systems since viscoelastic materials depend on time and frequency. A more appropriate reduction basis is obtained from the nonlinear, complex eigenvalue problem, whose eigenvectors capture the appropriate kinematics and enable frequency-based mode selection; unfortunately, the computational cost is prohibitive for computing these modes from large-scale engineering models. To address this shortcoming, this work proposes a novel two-tier reduction procedure to reduce the upfront cost of solving the complex, nonlinear eigenvalue problem. The first reduction step reduces the full-order model with real mode shapes linearized about various centering frequencies to capture the kinematics over a full range of viscoelastic material behavior (glassy, rubbery, and glass-transition zones). This tier-one reduction preserves time-temperature superposition and allows the equations to depend parametrically on operating temperature. The second-level reduction then solves the complex, nonlinear eigenmode solutions in the tier-one reduced space about a fixed temperature to further reduce the equations-of-motion. The method is demonstrated on a cantilevered sandwich plate to display its accuracy and efficiency in comparison to full-order model predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Theory and numerics of subspace approximation of eigenvalue problems

Large-scale eigenvalue problems arise in various fields of science and engineering and demand computationally efficient solutions. In this study, we investigate the subspace approximation for parametric linear eigenvalue problems, aiming to mitigate the computational burden associated with high-fidelity systems. Furthermore, we provide general error estimates under non-simple eigenvalue conditions, establishing some theoretical foundations for understanding the convergence behavior of subspace approximations. Numerical examples, including problems with one-dimensional to three-dimensional spatial domain and one-dimensional to two-dimensional parameter domain, are presented to demonstrate the efficacy of reduced basis method in handling parametric variations in boundary conditions and coefficient fields to achieve significant computational savings while maintaining high accuracy, making them promising tools for practical applications in large-scale eigenvalue computations.

Eigenvalue problems↗
DOE OSTI2024

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Polynomial Preconditioned Arnoldi with Stability Control

Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of matrix-vector products. Parallel computations can particularly benefit from the reduction of communication-intensive operations. Additoinally, the GMRES algorithm provides a simple and effective way of generating the preconditioning polynomial. For some problems high degree polynomials are especially effective, but they can lead to stability problems that must be mitigated. A two-level “double polynomial preconditioning” strategy provides an effective way to generate high-degree preconditioners.

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 OSTI2025

An eigenvalue-based method for computing the relaxed pressure in compressible multiphase flow with N phases

The modeling of compressible multiphase flows is a decades-old area of study with many applications across various fields. Many of these application areas use stiff pressure relaxation. This process involves the solution of a nonlinear system with N + 1 equations and N + 1 unknowns, where N is the number of phases. The resolution of this system with general equations of state (EOSs) is difficult. Furthermore, nonlinear systems can admit multiple solutions, and current solution methods do not address this possibility. Very recently, a thermodynamic relaxation method was introduced, which effectively maps a relatively simple predictor equation of state onto a more complex target equation of state. In this context, the target EOSs are the chosen EOSs for the thermodynamic model. Furthermore, this thermodynamic relaxation has the benefit of simplifying the stiff pressure relaxation system of equations. In this article, we show this system reduces to a polynomial of degree N, which can be recast as an eigenvalue problem through the use of the associated companion matrix. We show that although this eigenvalue method is generally less efficient than Newton–Raphson iteration, it does not suffer from convergence issues and finds all N roots of the polynomial. Hence, the method provides a fail-safe for root-finding iterative methods and a way to address the issue of multiple solutions to the nonlinear system of equations in stiff pressure relaxation.

Eigenvalue algorithm↗
DOE OSTI2019

Photonic Crystals Based on Media with Arbitrary Anisotropy of Permittivity and Permeability

A general approach to analyzing eigenmodes in anisotropic and gyrotropic 3D photonic crystals based on dielectric and magnetic media is proposed. This approach is based on the representation of stationary macroscopic Maxwell equations in the operator form corresponding to the quantum-mechanical equation for a photon with spin s = 1. In these equations, the strengths of electric and magnetic fields are put into correspondence with state vectors in the complex Hilbert space. The permittivity and permeability serve as operators acting on these vectors. It is shown that the problem of determining the eigenmodes of a photonic crystal is reduced to searching for eigenvectors and eigenvalues of the Hermitian operator characterizing the spin–orbit interaction of a photon in the periodic anisotropic medium under study. It is proposed to use photon states with a certain wave vector (certain momentum) and a certain linear or circular spin polarization as a basis for the representation operator equations. One-dimensional photonic crystals are considered as an example. The influence of anisotropy and gyrotropy on the dispersion of eigenmodes in these crystals is investigated. The group velocity of the eigenmodes, momentum transferred by them, and spin angular momentum are analyzed for the case of gyrotropic media.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Relativistic levels of mesic atoms

We revisit the derivation of the covariant two-body scalar-fermion equation with a Coulomb interaction, presented in a previous paper. We show that it can be given the formal aspect of a Dirac equation, but for the fact that the eigenvalue is also contained in one of the coefficients and thus it is not linearly included. The discussion of the boundary value problem is therefore different, although some properties of the Dirac equation can be recovered in an approximation bringing back to the concept of reduced mass. We discuss a mixed analytic-numerical method of solution which allows to obtain very accurate results and we calculate the lowest levels, states and QED corrections for pionic and kaonic atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Reduction of the molecular hamiltonian matrix using quantum community detection

Abstract Quantum chemistry is interested in calculating ground and excited states of molecular systems by solving the electronic Schrödinger equation. The exact numerical solution of this equation, frequently represented as an eigenvalue problem, remains unfeasible for most molecules and requires approximate methods. In this paper we introduce the use of Quantum Community Detection performed using the D-Wave quantum annealer to reduce the molecular Hamiltonian matrix in Slater determinant basis without chemical knowledge. Given a molecule represented by a matrix of Slater determinants, the connectivity between Slater determinants (as off-diagonal elements) is viewed as a graph adjacency matrix for determining multiple communities based on modularity maximization. A gauge metric based on perturbation theory is used to determine the lowest energy cluster. This cluster or sub-matrix of Slater determinants is used to calculate approximate ground state and excited state energies within chemical accuracy. The details of this method are described along with demonstrating its performance across multiple molecules of interest and bond dissociation cases. These examples provide proof-of-principle results for approximate solution of the electronic structure problem using quantum computing. This approach is general and shows potential to reduce the computational complexity of post-Hartree–Fock methods as future advances in quantum hardware become available.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Colloquium: Eigenvector continuation and projection-based emulators

Eigenvector continuation is a computational method for parametric eigenvalue problems that uses subspace projection with a basis derived from eigenvector snapshots from different parameter sets. It is part of a broader class of subspace-projection techniques called reduced-basis methods. In this Colloquium, the development, theory, and applications of eigenvector continuation and projection-based emulators are presented. In conclusion, the basic concepts are introduced, the underlying theory and convergence properties are discussed, and recent applications for quantum systems and future prospects are presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Rigid-Mode Limit of the Yokoya Matrix Formalism and the Burov-Lebedev Dispersion Equation

Transverse single-bunch instabilities of space-charge-dominated coasting beams with round and flat transverse geometries are studied using a unified dispersion-relation framework. The analysis combines the Burov-Lebedev formalism, which captures space-charge tune spread, Landau damping, and instability threshold behavior, with Yokoya’s projection method for representing coherent transverse mode structure and its dependence on beam aspect ratio. In the rigid-beam limit, the formulation reduces to a scalar dispersion relation of Burov-Lebedev paper. For non-rigid transverse oscillations, truncation of Yokoya’s Hermite-based expansion yields a finite-dimensional matrix eigenvalue problem in which space-charge and coupling impedance effects enter through Burov-Lebedev–type denominators. This approach provides a consistent basis for comparing rigid and non-rigid instability behavior in round and flat beams and for assessing the role of beam ellipticity in modifying coherent mode structure and stability thresholds.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

Entanglement Witness for Indistinguishable Electrons Using Solid-State Spectroscopy

Characterizing entanglement in quantum materials is crucial for advancing next-generation quantum technologies. Despite recent strides in witnessing entanglement in magnetic materials with distinguishable spin modes, quantifying entanglement in systems formed by indistinguishable electrons remains a formidable challenge. To solve this problem, we introduce a method to extract various four-fermion correlations by analyzing the nonlinearity in resonant inelastic x-ray scattering spectra. These correlations constitute the primary components of the cumulant two-particle reduced density matrix. We further derive bounds for its eigenvalues and demonstrate the linear scaling with fermionic entanglement depth, providing a reliable witness for entanglement. Using the material-relevant strongly correlated models as examples, we show how this entanglement witness can efficiently quantify multipartite entanglement across different phase regions, highlighting its advantage over quantum Fisher information. Published by the American Physical Society 2025

Liu, Tongtong (ORCID:0000000295324061)↗