Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Eigenvalues and eigenvectors”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Nonlinear deformation and elasticity of BCC refractory metals and alloys

Application of isotropic pressure or uniaxial strain alters the elastic properties of materials; sufficiently large strains can drive structural transformations. Linear elasticity describes stability against infinitesimal strains, while nonlinear elasticity describes the response to finite deformations. Here, it was previously shown that uniaxial strain along [100] drives refractory metals and alloys towards mechanical instabilities. These include an extensional instability, and a symmetry-breaking orthorhombic distortion caused by a Jahn-Teller-Peierls instability that splays the cubic lattice vectors. Here we analyze these transitions in depth. Eigenvalues and eigenvectors of the Wallace tensor identify and classify linear instabilities in the presence of strain. We show that both instabilities are discontinuous, leading to discrete jumps in the lattice parameters. We provide physical intuition for the instabilities by analyzing the changes in first-principles energy, stress, bond lengths, and angles upon application of strain. Electronic band structure calculations show differential occupation of bonding and antibonding orbitals, driven by the changing bond lengths and leading to the structural transformations. Strain thresholds for these instabilities depend on the valence electron count.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Experimental quantum learning of a spectral decomposition

Currently available quantum hardware allows for small-scale implementations of quantum machine learning algorithms. Such experiments aid the search for applications of quantum computers by benchmarking the near-term feasibility of candidate algorithms. Here we demonstrate the quantum learning of a two-qubit unitary by a sequence of three parameterized quantum circuits containing a total of 21 variational parameters. Moreover, we variationally diagonalize the unitary to learn its spectral decomposition, i.e., its eigenvalues and eigenvectors. We illustrate how this can be used as a subroutine to compress the depth of dynamical quantum simulations. One can view our implementation as a demonstration of entanglement-enhanced machine learning, as only a single (entangled) training data pair is required to learn a 4 × 4 unitary matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Gravitational Lensing Formalism in a Curved Arc Basis: A Continuous Description of Observables and Degeneracies from the Weak to the Strong Lensing Regime

Gravitationally lensed curved arcs provide a wealth of information about the underlying lensing distortions. Extracting precise lensing information from extended sources is a key component in many studies aiming to answer fundamental questions about the universe. To maintain accuracy with increased precision, it is of vital importance to characterize and understand the impact of degeneracies inherent in lensing observables. In this work, we present a formalism to describe the gravitational lensing distortion effects resulting in curved extended arcs based on the eigenvectors and eigenvalues of the local lensing Jacobian and their directional differentials. We identify a nonlocal and nonlinear extended deflector basis that inherits these local properties. Our parameterization is tightly linked to observable features in extended sources and allows one to accurately extract the lensing information of extended images without imposing an explicit global deflector model. We quantify what degeneracies can be broken based on specific assumptions about the local lensing nature and assumed intrinsic source shape. Our formalism is applicable from the weak linear regime to the semi-linear regime and all the way up to the highly nonlinear regime of highly magnified arcs of multiple images. Furthermore, the methodology and implementation presented in this work provides a framework to assessing systematics, to guide inference efforts in the right choices in complexity based on the data at hand, and to quantify the lensing information extracted in a model-independent way

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Delocalization of a non-Hermitian quantum walk on random media in one dimension

Highlights: • We study the localization-delocalization transition of a non-Hermitian quantum walk. • We find that the phase transition is similar to the one in the Hatano-Nelson model. • All eigenvectors get extended and all eigenvalues become complex at the transition. • This implies that the localization lengths of all eigenvectors are the same. We first review the localization–delocalization transition of a non-Hermitian random tight-binding Anderson model, called the Hatano–Nelson model. We then report a new result for a non-Hermitian extension of a discrete-time quantum walk on a one-dimensional random medium; we numerically find a delocalization transition similar to one of the Hatano–Nelson model. As a common feature to both models, at the transition point, an eigenvector gets delocalized and at the same time the corresponding energy eigenvalue (for the latter quantum-walk model, the imaginary unit times the phase of the eigenvalue of the time-evolution operator) becomes complex. One of the unique properties of the present non-Hermitian quantum walk is that the localization length of all eigenvectors is the same, and thereby all eigenstates simultaneously undergo the delocalization transition and all energy eigenvalues become complex at the same time when we turn up a non-Hermitian parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Superconductor to exciton condensate transition in a model copper-oxide material

Abstract Superconductivity and exciton condensation are fundamental phenomena in condensed matter physics, associated with the condensation of electron–electron and electron–hole pairs, respectively, into coherent quantum states. In this study, we present evidence of a superconductor to exciton condensate transition within the context of the three-band Hubbard model of copper-oxide-like materials. As the electron–electron repulsion increases, the superconducting phase is superseded by exciton condensation. In support of theoretical predictions—not yet realized experimentally—we observe the coexistence of the two condensates in the vicinity of the transition where the quantum states become a superposition of electron–electron and electron–hole condensates. Coexistence is rigorously computed from large eigenvalues and their eigenvectors in both the two-electron reduced density matrix (2-RDM) and the particle-hole RDM, which we obtain from a direct variational ground-state energy minimization with respect to the 2-RDM by semidefinite programming. We further discern that adjacent d orbitals and intervening p orbitals facilitate electron–electron pairing between copper orbitals, thereby supporting the superexchange mechanism for superconductivity. These observations suggest the feasibility of witnessing a superconductor to exciton condensate transition in copper-oxide analogs, bearing significant implications for identifying materials conducive to efficient transport processes.

Schouten, Anna O. (ORCID:0000000264255219)↗
DOE OSTI2022

Fission Matrix Processing Using the MCNP6.3 HDF5 Restart File

This paper describes an approach to interrogating the fission matrix available in the HDF5-formatted restart file (also known as the “runtape” file), which is produced by the upcoming public release of the MCNP R code, version 6.3. The fission matrix, its eigenvalues, and its eigenvectors, are important tools for characterizing fissile systems such as research and power reactors and for accelerating the convergence of the Monte Carlo fission-source site distribution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Towards Reconstruction of Complex Flow Fields Using Unit Flows

Many complex turbulent flows in nature and engineering can be qualitatively regarded as being constituted of multiple simpler unit flows. The objective of this work is to characterize the coherent structures in such complex flows as a combination of constituent unitary flow structures for the purpose of reduced-order representation. While turbulence is clearly a non-linear phenomenon, we aim to establish the degree to which the optimally weighted superposition of unitary flow structures can represent the complex flow structures. The rationale for investigating such superposition stems from the fact that the large-scale coherent structures are generated by underlying flow instabilities that may be reasonably described using linear analysis. Clearly, the degree of validity of superposition will depend on the flow under consideration. In this work, we take the first step toward establishing a procedure for investigating superposition. Experimental data of single and triple tandem jets in crossflow are used to demonstrate the procedure. A composite triple tandem jet flow field is generated from optimal superposition of single jet data and compared against ‘true’ triple jet data. Direct comparisons between the true and composite fields are made for spatial, temporal, and kinetic energy content. The large-scale features (obtained from proper orthogonal decomposition or POD) of true and composite tandem jet wakes exhibit nearly 70% agreement in terms of modal eigenvector correlation. Corresponding eigenvalues reveal that the kinetic energy of the flow is also emulated with only a slight overprediction. Temporal frequency features are also examined in an effort to completely characterize POD modes. The proposed method serves as a foundation for more rigorous and robust dimensional reduction in complex flows based on unit flow modes.

Kristo, Paul J.↗
DOE OSTI2021

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Why it is Unfortunate that Linear Machine Learning “Works” so well in Electromechanical Switching of Ferroelectric Thin Films

Machine learning (ML) is relied on for materials spectroscopy. It is challenging to make ML models fail because statistical correlations can mimic the physics without causality. Here, using a benchmark band-excitation piezoresponse force microscopy polarization spectroscopy (BEPS) dataset the pitfalls of the so-called “better”, “faster”, and “less-biased” ML of electromechanical switching are demonstrated and overcome. Using a toy and real experimental dataset, it is demonstrated how linear nontemporal ML methods result in physically reasonable embedding (eigenvalues) while producing nonsensical eigenvectors and generated spectra, promoting misleading interpretations. A new method of unsupervised multimodal hyperspectral analysis of BEPS is demonstrated using long-short-term memory (LSTM) β-variational autoencoders (β-VAEs) . By including LSTM neurons, the ordinal nature of ferroelectric switching is considered. Further, to improve the interpretability of the latent space, a variational Kullback–Leibler-divergency regularization is imposed . Finally, regularization scheduling of β as a disentanglement metric is leveraged to reduce user bias. Combining these experiment-inspired modifications enables the automated detection of ferroelectric switching mechanisms, including a complex two-step, three-state one. Ultimately, this work provides a robust ML method for the rapid discovery of electromechanical switching mechanisms in ferroelectrics and is applicable to other multimodal hyperspectral materials spectroscopies.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Generalized measure of quantum Fisher information

Here, we present a lower bound on the quantum Fisher information (QFI) which is efficiently computable on near-term quantum devices. This bound itself is of interest, as we show that it satisfies the canonical criteria of a QFI measure. Specifically, it is essentially a QFI measure for subnormalized states, and hence it generalizes the standard QFI in this sense. Our bound employs the generalized fidelity applied to a truncated state, which is constructed via the m largest eigenvalues and their corresponding eigenvectors of the probe quantum state ρ θ . Focusing on unitary families of exact states, we analyze the properties of our proposed lower bound, and demonstrate its utility for efficiently estimating the QFI.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Nowcasting Earthquakes: Imaging the Earthquake Cycle in California With Machine Learning

We propose a new machine learning-based method for nowcasting earthquakes to image the time-dependent earthquake cycle. The result is a timeseries that may correspond to the process of stress accumulation and release. The timeseries are constructed by using principal component analysis of regional seismicity. The patterns are found as eigenvectors of the cross-correlation matrix of a collection of seismicity timeseries in a coarse grained regional spatial grid (pattern recognition via unsupervised machine learning). The eigenvalues of this matrix represent the relative importance of the various eigenpatterns. Using the eigenvectors and eigenvalues, we compute the weighted correlation timeseries of the regional seismicity. This timeseries has the property that the weighted correlation generally decreases prior to major earthquakes in the region, and increases suddenly just after a major earthquake occurs. As in a previous paper, we find that this method produces a nowcasting timeseries that resembles the hypothesized regional stress accumulation and release process characterizing the earthquake cycle. We then address the problem of whether the timeseries contain information regarding future large earthquakes. For this, we compute a receiver operating characteristic and determine the decision thresholds for several future time periods of interest (optimization via supervised machine learning). We find that signals can be detected that can be used to characterize the information content of the timeseries. These signals may be useful in assessing present and near-future seismic hazards.

58 GEOSCIENCES↗
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 OSTI2023

Estimation of the Kelvin–Helmholtz Unstable Boundary

The Kelvin–Helmholtz (KH) instability is one of the most important mechanisms of the viscous-like interaction between the solar wind and the magnetosphere (MSP), which transport the mass, energy, momentum, and magnetic flux. Thus, it is important to examine whether the magnetopause boundary is KH unstable or not. Based on the KH onset conditions, this report proposes to use a matrix to identify the most KH unstable direction based on the in situ measurements of the density, velocity, and magnetic field in the MSP and magnetosheath. The range of the KH unstable direction can be easily estimated based on the eigenvalues of the matrix. The eigenvectors of the matrix provide a new boundary normal coordinate system, which could be useful for 2-D KH instability simulation.

79 ASTRONOMY AND ASTROPHYSICS↗
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 OSTI2023

High-Impedance Non-Linear Fault Detection via Eigenvalue Analysis with low PMU Sampling Rates

This work presents a hybrid data-driven and physics-based framework for high-impedance fault detection in power systems. An innovative method based on eigenvalue analysis is expanded and validated. Phasor Measurement Unit data is used to estimate eigenvalues corresponding to the powerlines being monitored. The projection and drift of these eigenvalues is then tracked and evaluated. Faults are detected as they drive eigenvalues outside of their normal zones. Eigenvectors are leveraged to support and validate the decisions made by the main algorithm. This technique holds several advantages over contemporary techniques in that it utilizes technology that is already deployed in the field, it offers a significant degree of generality, and so far it has displayed a very high-level of sensitivity without sacrificing accuracy. Validation takes place in the form of simulations in the IEEE 13 Node System considering a popular high-impedance non-linear fault model. Test results are encouraging indicating potential for real-life applications.

Paramo, Gian↗