Search NASA⌕ Search

SEARCH · Search NASA

Results for “Eigenvalue”

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 73 records · Page 4

Low-Rank Solution Methods for Stochastic Eigenvalue Problems

In this report, we study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. Furthermore, the algorithm is tested on two benchmark problems, a stochastic diffusion problem with some poorly separated eigenvalues, and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.

97 MATHEMATICS AND COMPUTING↗

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↗

Properties of definite Bethe–Salpeter eigenvalue problems

The Bethe-Salpeter eigenvalue problem is solved in condensed matter physics to estimate the absorption spectrum of solids. It is a structured eigenvalue problem. Its special structure appears in other approaches for studying electron excitation in molecules or solids also. When the Bethe-Salpeter Hamiltonian matrix is definite, the corresponding eigenvalue problem can be reduced to a symmetric eigenvalue problem. However, its special structure leads to a number of interesting spectral properties. We describe these properties that are crucial for developing efficient and reliable numerical algorithms for solving this class of problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Complex eigenvalue instantons and the Fredholm determinant expansion in the Gross-Witten-Wadia model

We study the leading nonperturbative corrections to the strong-coupling (ungapped) phase of the Gross-Witten-Wadia (GWW) integral over unitary matrices, to one-loop order. We compute these corrections directly in terms of eigenvalue tunneling in a holomorphic presentation of the integral over eigenvalues. The leading nonperturbative contribution to the partition function comes from a pair of complex eigenvalue instantons. We show that these are in fact “ghost instantons”, which are extrema of the one-eigenvalue effective potential on the “unphysical sheet” of the spectral curve and have been discussed in detail recently by Mariño, Schiappa, and Schwick. Further, we discuss the relationship of these instantons to the Fredholm determinant expansion of the unitary matrix integral, which has recently become an object of interest in the computations of BPS indices of supersymmetric gauge theories and black holes. We find that, after taking the ’t Hooft limit, the first correction given by the Fredholm determinant expansion of the GWW integral agrees precisely with the leading nonperturbative correction, to one-loop order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum eigenvalue estimation via time series analysis

We present an efficient method for estimating the eigenvalues of a Hamiltonian H from the expectation values of the evolution operator for various times. For a given quantum state ρ, our method outputs a list of eigenvalue estimates and approximate probabilities. Each probability depends on the support of ρ in those eigenstates of H associated with eigenvalues within an arbitrarily small range. The complexity of our method is polynomial in the inverse of a given precision parameter ε, which is the gap between eigenvalue estimates. Unlike the well-known quantum phase estimation algorithm that uses the quantum Fourier transform, our method does not require large ancillary systems, large sequences of controlled operations, or preserving coherence between experiments, and is therefore more attractive for near-term applications. The output of our method can be used to estimate spectral properties of H and other expectation values efficiently, within additive error proportional to ε.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Eigenvectors from Eigenvalues: a survey of a basic identity in linear algebra

If $A$ is an $n \times n$ Hermitian matrix with eigenvalues $\lambda_1(A),\dots,\lambda_n(A)$ and $i,j = 1,\dots,n$, then the $j^{\mathrm{th}}$ component $v_{i,j}$ of a unit eigenvector $v_i$ associated to the eigenvalue $\lambda_i(A)$ is related to the eigenvalues $\lambda_1(M_j),\dots,\lambda_{n-1}(M_j)$ of the minor $M_j$ of $A$ formed by removing the $j^{\mathrm{th}}$ row and column by the formula $$ |v_{i,j}|^2\prod_{k=1;k\neq i}^{n}\left(\lambda_i(A)-\lambda_k(A)\right)=\prod_{k=1}^{n-1}\left(\lambda_i(A)-\lambda_k(M_j)\right)\,.$$ We refer to this identity as the \emph{eigenvector-eigenvalue identity}. Despite the simple nature of this identity and the extremely mature state of development of linear algebra, this identity was not widely known until very recently. In this survey we describe the many times that this identity, or variants thereof, have been discovered and rediscovered in the literature (with the earliest precursor we know of appearing in 1934). We also provide a number of proofs and generalizations of the identity.

97 MATHEMATICS AND COMPUTING↗

Quantum phase estimation for a class of generalized eigenvalue problems

Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems Hv = λv , such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to generalized eigenvalue problems Av = λBv , which arise in many areas of science and engineering. Here, we answer this question affirmatively. A restricted class of generalized eigenvalue problems could be solved as efficiently as standard eigenvalue problems. A paradigmatic example is provided by Sturm-Liouville problems. Another example comes from linear ideal magnetohydrodynamics, where phase estimation could be used to determine the stability of magnetically confined plasmas in fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Distributed Estimation of All the Eigenvalues and Eigenvectors of Matrices Associated With Strongly Connected Digraphs

This letter considers the problem of estimating all the eigenvalues and eigenvectors of an irreducible matrix, corresponding to a strongly connected digraph, in the absence of knowledge on the global network topology. To this end, in this work we propose a unified distributed strategy performed by each node in the network and relies only on the local information. The key idea is to transform the nonlinear problem of computing both the eigenvalues and eigenvectors of an irreducible matrix into a linear one. Specifically, we first transform distributively the irreducible matrix into a nonsingular irreducible matrix. Each node in the network then estimates in a distributed fashion the inverse of the nonsingular matrix by solving a set of linear equations based on a consensus-type algorithm. The eigenvalues and the corresponding eigenvectors are finally computed by exploiting the relations between the eigenvalues and eigenvectors of both the inverse and the original irreducible matrices. A numerical example is provided to demonstrate the effectiveness of the proposed distributed strategy.

14 SOLAR ENERGY↗

Statistical uncertainty of fission matrix eigenvalues using perturbation theory

Eigenvalue search of high dominance ratio systems may be slow to converge. The fission matrix element is defined by its element (FM){sub ij}, which are the probability for a neutron born in cell i to create a fission in cell j for a spatial mesh of n{sub i}*n{sub j} elements. Fission matrices are used in Monte Carlo criticality simulations to enhance computing speed, but also to find higher order eigenvalues. However, few studies have been made on the link between statistical uncertainties of fission matrix elements and eigenvalues uncertainties. Thus, dominance ratio statistical uncertainties remain unknown. This paper uses a new generalized perturbation theory (GPT) method to estimate sensitivities of eigenvalues to fission matrix elements and then to calculate dominance ratio uncertainties.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Eigenvalue Problems for Exponential-Type Kernels

Here, We study approximations of eigenvalue problems for integral operators associated with kernel functions of exponential type. We show convergence rate | λ k - λ k , h | ≤ C k h 2 in the case of lowest order approximation for both Galerkin and Nystrom methods, where h is the mesh size, λ k and λ k , h are the exact and approximate k th largest eigenvalues, respectively. We prove that the two methods are numerically equivalent in the sense that | λ k , h ( G ) - λ k , h ( N ) | ≤ C h 2 , where λ k , h ( G ) and λ k , h ( N ) denote the k th largest eigenvalues computed by Galerkin and Nystrom methods, respectively, and C is a eigenvalue independent constant. The theoretical results are accompanied by a series of numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Recent advances in numerical analysis of structural eigenvalue problems

A wide range of eigenvalue problems encountered in practical structural engineering analyses is defined, in which the structures are assumed to be discretized by any suitable technique such as the finite-element method. A review of the usual numerical procedures for the solution of such eigenvalue problems is presented and is followed by an extensive account of recently developed eigenproblem solution procedures. Particular emphasis is placed on the new numerical algorithms and associated computer programs based on the Sturm sequence method. Eigenvalue algorithms developed for efficient solution of natural frequency and buckling problems of structures are presented, as well as some eigenvalue procedures formulated in connection with the solution of quadratic matrix equations associated with free vibration analysis of structures. A new algorithm is described for natural frequency analysis of damped structural systems.

Gupta, K. K.↗

Multiple eigenvalues of sound-absorbing circular and annular ducts

Eigenvalue equations of the form D(lambda) = 0 are studied for acoustic modes in circular and annular ducts without flow. The ducts have locally reacting walls with arbitrary wall admittance. It is shown that circular ducts may have double eigenvalues, or wall admittances where both D(lambda) and D prime (lambda) are zero. These double eigenvalues are formed by the coalescence of the lowest-order eigenfunction with some higher-order eigenfunction. The eigenfunctions, or acoustic modes, associated with the double eigenvalues are found to be orthogonal to themselves so that the standard expansion formula for the acoustic field, which is obtained from a separation-of-variables analysis, is invalid. An alternate expansion formula for the acoustic field is derived. This alternate formula shows that the coalesced acoustic mode is linearly amplified by the transmission distance and exponentially attenuated at the expected rate. The expansion formula also reveals a new eigenfunction, or acoustic mode, which is exponentially attenuated at the same rate as the coalesced eigenfunction.

Zorumski, W. E.↗

On eigenvectors of multiple eigenvalues obtained in NASTRAN

In the case of nonmultiple eigenvalues, each of the three real eigenvalue extraction methods available in NASTRAN will, for a given type of normalization, give essentially the same eigenvectors, but this is not so in the case of multiple eigenvalues. This discrepancy is explained and illustrated by considering the example of a NASTRAN demonstration problem that has both multiple and nonmultiple eigenvalues.

Pamidi, P. R.↗

Numerical determination of the fundamental eigenvalue for the Laplace operator on a spherical domain

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (i.e., the membrane eignevalue problem for the vibration equation) on the unit spherical surface are developed. Two types of spherical surface domains are considered: the interior of a spherical triangle, and the exterior of a great circle arc extending for less than pi radians (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is employed. The fundamental eigenvalue is approximated by iteration utilizing the power method and point successive overrelaxation. Some numerical results are given and compared, in certain special cases, with analytical solutions to the eigenvalue problem. The significance of the numerical eigenvalue results is discussed in terms of the singularities in the solution of three-dimensional boundary-value problems near a polyhedral corner of the domain.

Walden, H.↗

An eigenvalue method for solving transient heat conduction problems

The eigenvalue method, which has been used by researchers in structure mechanics, is applied to problems in heat conduction. Its formulation is decribed in terms of an examination of transient heat conduction in a square slab. Taking advantage of the availability of the exact solution, we compare the accuracy and other numerical properties of the eigenvalue method with those of existing numerical schemes. The comparsion shows that, overall, the eigenvalue method appears to be fairly attractive. Furthermore, only a few dominant eigenvalues and their corresponding eigenvectors need to be computed and retained to yield reasonably high accuracy. Greater savings are attained in the computation time for a transient problem with long time duration and a large computational domain.

Shih, T. M.↗

On the design derivatives of eigenvalues and eigenvectors for distributed parameter systems

In this paper, analytic expressions are obtained for the design derivatives of eigenvalues and eigenfunctions of self-adjoint linear distributed parameter systems. Explicit treatment of boundary conditions is avoided by casting the eigenvalue equation into integral form. Results are expressed in terms of the linear operators defining the eigenvalue problem, and are therefore quite general. Sufficiency conditions appropriate to structural optimization of eigenvalues are obtained.

Reiss, R.↗

Sensitivity analysis and approximation methods for general eigenvalue problems

Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

Murthy, D. V.↗