Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvector localization”

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
NASA NTRS1994

Numerical Wave Propagation 211 Based on Wave Primitives

Compact higher order finite difference equations are applied to a sequence of problems in wave propagation and aeroacoustics. Systems of PDE's are reduced to a sequence of simple wave primitives using a local eigenvector decomposition. The wave primitives are first order PDE's in two independent variable and allow natural boundary conditions to be imposed for both single- and multidimensional problems. The method uses a "discrete dispersion relation" approach to obtain high order approximations to the wave primitives on a 3 spatial point / 2 time level computational molecule. The scheme is fourth order accurate for the class of system with constant coefficients, e.g., those that support exponential solutions. Weakly non-linear PDE's are solved in a similar manner using a variant of the "method of frozen coefficients." Experience with the new algorithm for linear, non-linear, and multi-dimensional test problems will be described.

Davis, Sanford S.↗
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↗
NASA NTRS1979

Design of robust state feedback controllers via eigenvalue/eigenvector assignment

A new method of selecting a multivariable state feedback controller is presented. The resulting controller simultaneously realizes arbitrary closed-loop eigenvalues, approximates specified modal behavior and achieves low eigensystem sensitivity with respect to plant parameter variations. The method characterizes a vector space slightly larger than the null space of the closed-loop system matrix and projects a desired modal matrix onto this space. Sensitivity of eigenvalues and eigenvectors is then minimized local to the desired modal matrix using a gradient search technique. A tutorial example to illustrate the design procedure is given.

Mielke, R. R.↗
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 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↗
NASA NTRS1987

Direct numerical simulation of buoyantly driven turbulence

Numerical simulations of homogeneous turbulence subject to buoyant forcing were performed. The presence of a mean temperature gradient combined with a gravitational field results in a forcing term in the momentum equations. The development of the turbulence was studied and compared to the decay of similar fields in the absence of gravity. In the buoyantly driven field, the vorticity is preferentially aligned with the intermediate eigenvector of the strain-rate tensor and the local temperature gradient is more likely to be aligned with the most compressive eigenvector. These relationships are qualitatively similar to those observed in previous shear flow results studied by Ashurst (1987). A tensor diffusivity model for passive scalar transport developed from shear flow results in Rogers, Moin, and Reynolds (1986) also predicts this buoyant scalar transport, indicating that the relationship between the scalar flux and the Reynolds stress is similar in both flows.

Ashurst, William T.↗
DOE OSTI2025

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis

In studies on complex network systems using graph theory, eigen-analysis is typically performed on an undirected graph model of the network. However, when analyzing cascading failures in a power system, the interactions among failures suggest the need for a directed graph beyond the topology of the power system to model directions of failure propagation. To accurately quantify failure interactions for effective mitigation strategies, this paper proposes a stochastic interaction graph model and associated eigen-analysis. Different types of modes on failure propagations are defined and characterized by the eigenvalues of a stochastic interaction matrix, whose absolute values are unity, zero, or in between. Finding and interpreting these modes helps identify the probable patterns of failure propagation, either local or widespread, and the participating components based on eigenvectors. Then, by lowering the failure probabilities of critical components highly participating in a mode of widespread failures, cascading can be mitigated. Here, the validity of the proposed stochastic interaction graph model, eigen-analysis and the resulting mitigation strategies is demonstrated using simulated cascading failure data on an NPCC 140-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1979

Eigenvalues and eigenvectors for hybrid coordinate equations of motion for flexible spacecraft

The eigenvalues and eigenvectors of a system of linear time-invariant equations describing the attitude motion of flexible spacecraft in terms of hybrid coordinates are characterized in terms of literal expressions by using peculiar properties of the system parameter matrices. For the undamped case the eigenvalues are localized in terms of inertial matrices and modal parameters. A procedure for calculating the eigenvectors is proposed whereby the eigenproblem associated with the original system of dimension (2N + 6) is reduced to that of a symmetric and positive definite matrix of dimension N with the zero-damping assumption. The eigenvectors for systems of large dimension are obtained explicitly in terms of a 3x1 matrix whose elements are available from a system of three algebraic equations, which is provided.

Ohkami, Y.↗
DOE OSTI2022

Mutual spin-phonon driving effects and phonon eigenvector renormalization in nickel (II) oxide

The physics of mutual interaction of phonon quasiparticles with electronic spin degrees of freedom, leading to unusual transport phenomena of spin and heat, has been a subject of continuing interests for decades. Despite its pivotal role in transport processes, the effect of spin-phonon coupling on the phonon system, especially acoustic phonon properties, has so far been elusive. By means of inelastic neutron scattering and first-principles calculations, anomalous scattering spectral intensity from acoustic phonons was identified in the exemplary collinear antiferromagnetic nickel (II) oxide, unveiling strong spin-lattice correlations that renormalize the polarization of acoustic phonon. In particular, a clear magnetic scattering signature of the measured neutron scattering intensity from acoustic phonons is demonstrated by its momentum transfer and temperature dependences. The anomalous scattering intensity is successfully modeled with a modified magneto-vibrational scattering cross-section, suggesting the presence of spin precession driven by phonon. The renormalization of phonon eigenvector is indicated by the observed “geometry-forbidden” neutron scattering intensity from transverse acoustic phonon. Importantly, the eigenvector renormalization cannot be explained by magnetostriction but instead, it could result from the coupling between phonon and local magnetization of ions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1984

Universal single level implicit algorithm for gasdynamics

A single level effectively explicit implicit algorithm for gasdynamics is presented. The method meets all the requirements for unconditionally stable global iteration over flows with mixed supersonic and supersonic zones including blunt body flow and boundary layer flows with strong interaction and streamwise separation. For hyperbolic (supersonic flow) regions the method is automatically equivalent to contemporary space marching methods. For elliptic (subsonic flow) regions, rapid convergence is facilitated by alternating direction solution sweeps which bring both sets of eigenvectors and the influence of both boundaries of a coordinate line equally into play. Point by point updating of the data with local iteration on the solution procedure at each spatial step as the sweeps progress not only renders the method single level in storage but, also, improves nonlinear accuracy to accelerate convergence by an order of magnitude over related two level linearized implicit methods. The method derives robust stability from the combination of an eigenvector split upwind difference method (CSCM) with diagonally dominant ADI(DDADI) approximate factorization and computed characteristic boundary approximations.

Lombard, C. K.↗
DOE OSTI2023

Floating Block Method for Quantum Monte Carlo Simulations

Quantum Monte Carlo simulations are powerful and versatile tools for the quantum many-body problem. In addition to the usual calculations of energies and eigenstate observables, quantum Monte Carlo simulations can in principle be used to build fast and accurate many-body emulators using eigenvector continuation or design time-dependent Hamiltonians for adiabatic quantum computing. Furthermore, these new applications require something that is missing from the published literature, an efficient quantum Monte Carlo scheme for computing the inner product of ground state eigenvectors corresponding to different Hamiltonians. In this work, we introduce an algorithm called the floating block method, which solves the problem by performing Euclidean time evolution with two different Hamiltonians and interleaving the corresponding time blocks. We use the floating block method and nuclear lattice simulations to build eigenvector continuation emulators for energies of 4 He, 8 Be, 12 C, and 16 O nuclei over a range of local and nonlocal interaction couplings. From the emulator data, we identify the quantum phase transition line from a Bose gas of alpha particles to a nuclear liquid.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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↗
NASA NTRS1987

Improvement of modal scaling factors using mass additive technique

A general investigation into the improvement of modal scaling factors of an experimental modal model using additive technique is discussed. Data base required by the proposed method consists of an experimental modal model (a set of complex eigenvalues and eigenvectors) of the original structure and a corresponding set of complex eigenvalues of the mass-added structure. Three analytical methods,i.e., first order and second order perturbation methods, and local eigenvalue modification technique, are proposed to predict the improved modal scaling factors. Difficulties encountered in scaling closely spaced modes are discussed. Methods to compute the necessary rotational modal vectors at the mass additive points are also proposed to increase the accuracy of the analytical prediction.

Zhang, Qiang↗
NASA NTRS1992

Improved procedures for eigenvalue approximation and sensitivities for active structures

The equations of motion of actively controlled structures are usually reduced to first order form, a procedure which obscures symmetries that are present in the second order form of these equations. The loss of symmetry requires the calculation of both left and right eigenvectors for obtaining derivatives of the stability eigenvalues of the system. The paper shows that, for some control laws, only right eigenvectors are required if derivatives are obtained from the second order form of the equations of motion. The paper also examines reduced basis approximations for the eigenvalues and their derivatives. It is shown that including Ritz vectors representing the effect of local actuation forces in the reduced basis improves the accuracy of the eigenvalues and eigenvalue derivatives. Two active truss examples are used for demonstrating the improved accuracy.

Ponslet, Eric↗
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 OSTI2022

Coupled Cluster Downfolding Theory: towards universal many-body algorithms for dimensionality reduction of composite quantum systems in chemistry and materials science

Abstract The recently introduced coupled cluster (CC) downfolding techniques for reducing the dimensionality of quantum many-body problems recast the CC formalism in the form of the renormalization procedure allowing, for the construction of effective (or downfolded) Hamiltonians in small-dimensionality sub-space, usually identified with the so-called active space, of the entire Hilbert space. The resulting downfolded Hamiltonians integrate out the external (out-of-active-space) Fermionic degrees of freedom from the internal (in-the-active-space) parameters of the wave function, which can be determined as components of the eigenvectors of the downfolded Hamiltonians in the active space. This paper will discuss the extension of non-Hermitian (associated with standard CC formulations) and Hermitian (associated with the unitary CC approaches) downfolding formulations to composite quantum systems commonly encountered in materials science and chemistry. The non-Hermitian formulation can provide a platform for developing local CC approaches, while the Hermitian one can serve as an ideal foundation for developing various quantum computing applications based on the limited quantum resources. We also discuss the algorithm for extracting the semi-analytical form of the inter-electron interactions in the active spaces.

Bauman, Nicholas P.↗