Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue method”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Material coherence from trajectories via Burau eigenanalysis of braids

In this paper, we provide a numerical tool to study a material’s coherence from a set of 2D Lagrangian trajectories sampling a dynamical system, i.e., from the motion of passive tracers. We show that eigenvectors of the Burau representation of a topological braid derived from the trajectories have levelsets corresponding to components of the Nielsen–Thurston decomposition of the dynamical system. One can thus detect and identify clusters of space–time trajectories corresponding to coherent regions of the dynamical system by solving an eigenvalue problem. Unlike previous methods, the scalable computational complexity of our braid-based approach allows the analysis of large amounts of trajectories.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Lanczos Algorithm, the Transfer Matrix, and the Signal-to-Noise Problem

This Letter introduces a method for determining the energy spectrum of lattice quantum chromodynamics by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to filter out spurious eigenvalues. Proof-of-principle analyses of the simple harmonic oscillator and the lattice quantum chromodynamics proton mass demonstrate that this method provides faster ground-state convergence than the “effective mass,” which is related to the power-iteration algorithm. Lanczos provides more accurate energy estimates than multistate fits to correlation functions with small imaginary times while achieving comparable statistical precision. Two-sided error bounds are computed for Lanczos results and guarantee that excited-state effects cannot shift Lanczos results far outside their statistical uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers

We introduce a multi-modal, multi-level quantum complex exponential least squares (MM-QCELS) method to simultaneously estimate multiple eigenvalues of a quantum Hamiltonian on early fault-tolerant quantum computers. Our theoretical analysis demonstrates that the algorithm exhibits Heisenberg-limited scaling in terms of circuit depth and total cost. Notably, the proposed quantum circuit utilizes just one ancilla qubit, and with appropriate initial state conditions, it achieves significantly shorter circuit depths compared to circuits based on quantum phase estimation (QPE). Numerical results suggest that compared to QPE, the circuit depth can be reduced by around two orders of magnitude under several settings for estimating ground-state and excited-state energies of certain quantum systems.

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

Convergence of Eigenvector Continuation

Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to selected training values of the control parameters. The method has proven to be very efficient and accurate for interpolating and extrapolating eigenvectors. However, almost nothing is known about how the method converges, and its rapid convergence properties have remained mysterious. In this Letter, we present the first study of the convergence of eigenvector continuation. In order to perform the mathematical analysis, we introduce a new variant of eigenvector continuation that we call vector continuation. We first prove that eigenvector continuation and vector continuation have identical convergence properties and then analyze the convergence of vector continuation. Our analysis shows that, in general, eigenvector continuation converges more rapidly than perturbation theory. The faster convergence is achieved by eliminating a phenomenon that we call differential folding, the interference between nonorthogonal vectors appearing at different orders in perturbation theory. From our analysis we can predict how eigenvector continuation converges both inside and outside the radius of convergence of perturbation theory. Further, while eigenvector continuation is a nonperturbative method, we show that its rate of convergence can be deduced from power series expansions of the eigenvectors. Our results also yield new insights into the nature of divergences in perturbation theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

On the Theory of Elastic Scattering of Particles

The problem of elastic scattering of particles has been considered by the potential quantization method. The properties of the eigenfunctions ϕ{sub ν}{sup (+)}(r) and eigenvalues α{sub ν}{sup (+)} of this method for states with positive energies (continuous spectrum) have been studied. Under the assumption of the completeness of the set {ϕ_ν"("+")(r)}, the problem has been solved by expanding the desired wavefunction in this set. The proposed approach reproduces known results in all considered limiting cases. At the same time, it gives a more detailed description of the scattering amplitude than the standard phase theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

A Refinement-by-Superposition -Method for (curl)- and (div)-Conforming Discretizations

Here, we present refinement-by-superposition (RBS) hp-refinement infrastructure for computational electromagnetics (CEMs), which permits exponential rates of convergence. In contrast to dominant approaches to hp-refinement for continuous Galerkin methods, which rely on explicit constraint equations, the multilevel strategy presented drastically reduces the implementation complexity. Through the RBS methodology, enforcement of continuity occurs by construction, enabling arbitrary levels of refinement with ease, and without the practical (but not theoretical) limitations of constrained-node refinement. We outline the construction of the RBS hp-method for refinement with H (curl)- and H (div)-conforming finite cells. Numerical simulations for the 2-D finite element method (FEM) solution of the Maxwell eigenvalue problem demonstrate the effectiveness of RBS hp-refinement. As an additional goal of this work, we aim to promote the use of mixed-order (low- and high-order) elements in practical CEM applications.

42 ENGINEERING↗
DOE OSTI2018

GSTS-Uzawa method for a class of complex singular saddle point problems

In this paper, we propose GSTS–Uzawa method for solving a class of complex singular saddle point problems based on generalized skew-Hermitian triangular splitting (GSTS) iteration method and classical Uzawa method. We research on its semi-convergence properties and the eigenvalues distributions of its preconditioned matrix. The resulting GSTS–Uzawa preconditioner is used to precondition Krylov subspace methods such as the restarted generalized minimal residual (GMRES) method for solving the equivalent formulation of the complex singular saddle point problems. The theoretical results and effectiveness of the GSTS–Uzawa method are supported by a numerical example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A parallel, distributed memory implementation of the adaptive sampling configuration interaction method

The many-body simulation of quantum systems is an active field of research that involves several different methods targeting various computing platforms. Many methods commonly employed, particularly coupled cluster methods, have been adapted to leverage the latest advances in modern high-performance computing. Selected configuration interaction (sCI) methods have seen extensive usage and development in recent years. However, the development of sCI methods targeting massively parallel resources has been explored only in a few research works. Here, we present a parallel, distributed memory implementation of the adaptive sampling configuration interaction approach (ASCI) for sCI. In particular, we will address the key concerns pertaining to the parallelization of the determinant search and selection, Hamiltonian formation, and the variational eigenvalue calculation for the ASCI method. Load balancing in the search step is achieved through the application of memory-efficient determinant constraints originally developed for the ASCI-PT2 method. The presented benchmarks demonstrate near optimal speedup for ASCI calculations of Cr 2 (24e, 30o) with 10 6 , 10 7 , and 3 × 10 8 variational determinants on up to 16 384 CPUs. Importantly, to the best of the authors’ knowledge, this is the largest variational ASCI calculation to date.

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

Clustering in structure and reactions using configuration interaction techniques

Atomic nuclei are remarkable quantum many-body systems where clustering properties develop naturally from underlying interactions between the constituent nucleons. Clustering degrees of freedom manifest themselves in multiple structure and reaction observables. Our goal is to study nuclear clustering and its emergence in many-nucleon dynamics from nucleon-nucleon interactions. Clustering is a phenomenon that is known to emerge on the boundary between structure and reactions, therefore developing appropriate techniques that bridge the structure-reaction divide and establishing connections to observables is among our principal objectives. Showing consistency and how the new techniques can be reduced to well established other methods is an important part of this work. Here, the configuration-interaction technique based on second quantization is used to treat the quantum many-body problem assuring that fermionic antisymmetry is fully satisfied. The use of the harmonic oscillator single-particle basis allows for the center-of-mass coordinate to be separated and prepared in a desired oscillator state for each cluster. The relative motion reaction basis channels are constructed by coupling clusters in different harmonic oscillator states with respect to their relative motion. Finally, using a resonating group method strategy we solve the generalized eigenvalue problem to obtain scattering channels. Structural clustering characteristics are discussed and the modified harmonic oscillator representation for scattering equations method is used to extract scattering observables. New methods for treating clustering problems have been put forward. We demonstrate broad applicability of the developed techniques. Examples highlight connections with algebraic techniques, and the role of approximations leading to algebraic limits is assessed using realistic examples. Various types of clustering characteristics are used to study alpha clustering in light nuclei that are relevant to currently ongoing experimental efforts. We demonstrate the emergence of strongly clustered bands of states in beryllium, triple alpha channels in 12 C, and molecular type clustering in 21 Ne. Starting from nucleon-nucleon interactions without any additional assumptions scattering phase shifts for alpha-alpha scattering are determined and shown to be consistent with those observed. In this work we put forward a new configuration-interaction-based method that targets the physics of clustering, and further unifies nuclear structure and reactions. We provide detailed discussions and many examples highlighting features and advantages of the approach.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

Analyzing honeycomb photonic crystal waveguides by Dirichlet-to-Neumann maps

As an analog to graphene, honeycomb photonic crystals (PhCs) have attracted a great deal of interest in recent years. The additional degrees of freedom in a honeycomb PhC are useful in designing and optimizing waveguides, can be used to control the symmetry of the system and to realize novel optical devices. In this paper, we present an efficient numerical method for analyzing two-dimensional honeycomb PhC waveguides. Our method is based on a special supercell that covers one period of the honeycomb PhC waveguide and the so-called Dirichlet-to-Neumann map of the supercell. The method gives rise to a linear eigenvalue value problem with relatively small matrices, and it is validated by comparing with previous works. As an application of the method, we calculate edge modes for a few different PhCs. For a honeycomb PhC with dielectric rods in air, we found an edge mode at the zigzag edge, without using special modified rods at the edge. For a honeycomb PhC with air holes, we found a new edge mode when the PhC is bounded by a perfectly electric conductor.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2019

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Formulation of the density eigenvalue problem in neutron transport for relevant engineering applications

A new formulation of the density eigenvalue problem for the neutron transport equation is presented. This new eigenvalue, named ζ eigenvalue can be introduced freely in the transport model, acting on a selected portion of the phase space. Despite its broader applications and its connection with the nature of the transport operator, the ζ eigenvalue has been presented here mainly as a design-oriented technique for the efficient evaluation of the critical concentration for a specific nuclide (or mixture of nuclides). This new eigenvalue is particularly adequate to study the definition of the material composition in the criticality design process of a multiplying system. The method is then applied for the study of classical problems such as the critical moderation ratio and the poison concentration to control the reactor. Some results are presented in one dimensional configuration using the multi- group spherical harmonics approach. This eigenvalue formulation proves to be a convenient and useful way to attain criticality, also for complex, realistic systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Impact of Increased Latent Generations on Sensitivity Calculations with SCALE

Analyses of cross section sensitivity data from systems with fissile material allow analysts to associate an importance for each material, nuclide, reaction, and neutron energy by simulating real world criticality scenarios. Although criticality safety validation efforts can be guided by the cross-section sensitivity and uncertainty data generated for a particular system, these calculations can often be computationally expensive and sometimes cumbersome without proper guidance. The TSUNAMI suite within the SCALE code package has several methods for generating sensitivity data, including multigroup and continuous energy (CE) capabilities. The release of SCALE 6.3 has three different CE methods for generating cross section sensitivity data: (1) the Iterated Fission Probability (IFP) method with the KENO Monte Carlo transport solver, (2) the IFP method with the Shift Monte Carlo transport solver, and (3) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method with the KENO Monte Carlo transport solver. Although the CLUTCH method has additional parameters for generating sensitivity data files relative to the IFP method, all three methods use latent generations, which are the generations between an event (i.e., fission) and the assessment of importance based on the asymptotic population of progeny neutrons. Increasing the number of latent generations in a calculation leads to increased discrimination of the sensitivity coefficients but at the cost of the increased uncertainty associated with those generated values. Analysts must balance the accuracy of the sensitivity calculations and its uncertainty with the associated computational cost involved in generating the values. This paper discusses the impact of adjusting the latent generation parameter for a range of sensitivity values and how these changes compare with the direct perturbation values obtained from a change of ±0.5% Δ k in both benchmark and safety application models. Two benchmarks from the International Handbook of Evaluated Criticality Safety Benchmark Experiments and the MPC-32 dual purpose canister for spent nuclear fuel are used for analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Collocation Methods for Exploring Perturbations in Linear Stability Analysis

Eigenvalue analysis is a well-established tool for stability analysis of dynamical systems. However, there are situations where eigenvalues miss some important features of physical models. For example, in models of incompressible fluid dynamics, there are examples where linear stability analysis predicts stability but transient simulations exhibit significant growth of infinitesimal perturbations. This behavior can be predicted by pseudospectral analysis. In this study, we show that an approach similar to pseudospectral analysis can be performed inexpensively using stochastic collocation methods and the results can be used to provide quantitative information about instability.In addition, we demonstrate that the results of the perturbation analysis provide insight into the behavior of unsteady flow simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Filtered Rayleigh-Ritz is all you need

Recent work has shown that the (block) Lanczos algorithm can be used to extract approximate energy spectra and matrix elements from (matrices of) correlation functions in quantum field theory, and identified exact coincidences between Lanczos analysis methods and others. In this work, we note another coincidence: the Lanczos algorithm is equivalent to the well-known Rayleigh-Ritz method applied to Krylov subspaces. Rayleigh-Ritz provides optimal eigenvalue approximations within subspaces; we find that spurious-state filtering allows these optimality guarantees to be retained in the presence of statistical noise. We explore the relation between Lanczos and Prony's method, their block generalizations, generalized pencil of functions (GPOF), and methods based on the generalized eigenvalue problem (GEVP), and find they all fall into a larger "Prony-Ritz equivalence class", identified as all methods which solve a finite-dimensional spectrum exactly given sufficient correlation function (matrix) data. This equivalence allows simpler and more numerically stable implementations of (block) Lanczos analyses.

97 MATHEMATICS AND COMPUTING↗