Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalues”

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 55 records · Page 3

First Bloch eigenvalue in high contrast media

This paper deals with the asymptotic behavior of the first Bloch eigenvalue in a heterogeneous medium with a high contrast εY-periodic conductivity. When the conductivity is bounded in L{sup 1} and the constant of the Poincaré-Wirtinger weighted by the conductivity is very small with respect to ε{sup −2}, the first Bloch eigenvalue converges as ε → 0 to a limit which preserves the second-order expansion with respect to the Bloch parameter. In dimension two the expansion of the limit can be improved until the fourth-order under the same hypotheses. On the contrary, in dimension three a fibers reinforced medium combined with a L{sup 1}-unbounded conductivity leads us to a discontinuity of the limit first Bloch eigenvalue as the Bloch parameter tends to zero but remains not orthogonal to the direction of the fibers. Therefore, the high contrast conductivity of the microstructure induces an anomalous effect, since for a given low-contrast conductivity the first Bloch eigenvalue is known to be analytic with respect to the Bloch parameter around zero.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of structural correlations in a model binary 3D liquid through the eigenvalues and eigenvectors of the atomic stress tensors

It is possible to associate with every atom or molecule in a liquid its own atomic stress tensor. These atomic stress tensors can be used to describe liquids’ structures and to investigate the connection between structural and dynamic properties. In particular, atomic stresses allow to address atomic scale correlations relevant to the Green-Kubo expression for viscosity. Previously correlations between the atomic stresses of different atoms were studied using the Cartesian representation of the stress tensors or the representation based on spherical harmonics. In this paper we address structural correlations in a 3D model binary liquid using the eigenvalues and eigenvectors of the atomic stress tensors. This approach allows to interpret correlations relevant to the Green-Kubo expression for viscosity in a simple geometric way. On decrease of temperature the changes in the relevant stress correlation function between different atoms are significantly more pronounced than the changes in the pair density function. We demonstrate that this behaviour originates from the orientational correlations between the eigenvectors of the atomic stress tensors. We also found correlations between the eigenvalues of the same atomic stress tensor. For the studied system, with purely repulsive interactions between the particles, the eigenvalues of every atomic stress tensor are positive and they can be ordered: λ{sub 1} ≥ λ{sub 2} ≥ λ{sub 3} ≥ 0. We found that, for the particles of a given type, the probability distributions of the ratios (λ{sub 2}/λ{sub 1}) and (λ{sub 3}/λ{sub 2}) are essentially identical to each other in the liquids state. We also found that λ{sub 2} tends to be equal to the geometric average of λ{sub 1} and λ{sub 3}. In our view, correlations between the eigenvalues may represent “the Poisson ratio effect” at the atomic scale.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗

Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling

The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

43 PARTICLE ACCELERATORS↗

Determining Importance Weighting Functions for Contributon Theory Eigenvalue Sensitivity Coefficient Methodologies

This study introduced three approaches for calculating the importance weighting function for Contributon and CLUTCH eigenvalue sensitivity coefficient calculations, and compared them in terms of accuracy and applicability. The necessary levels of mesh refinement and mesh convergence for obtaining accurate eigenvalue sensitivity coefficients were determined through two parametric studies, and the results of these studies suggest that a sufficiently-accurate mesh for calculating eigenvalue sensitivity coefficients can be obtained for the Contributon and CLUTCH methods with only a small increase in problem runtime.

99 GENERAL AND MISCELLANEOUS↗

A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems

We consider the nonlinear eigenvalue problem M ( λ ) x = 0, where M ( λ ) is a large parameter-dependent matrix. In several applications, M ( λ ) has a structure where the higher-order terms of its Taylor expansion have a particular low-rank structure. We propose a new Arnoldi-based algorithm that can exploit this structure. More precisely, the proposed algorithm is equivalent to Arnoldi's method applied to an operator whose reciprocal eigenvalues are solutions to the nonlinear eigenvalue problem. The iterates in the algorithm are functions represented in a particular structured vector-valued polynomial basis similar to the construction in the infinite Arnoldi method [Jarlebring, Michiels, and Meerbergen, Numer. Math., 122 (2012), pp. 169–195]. In this paper, the low-rank structure is exploited by applying an additional operator and by using a more compact representation of the functions. This reduces the computational cost associated with orthogonalization, as well as the required memory resources. The structure exploitation also provides a natural way in carrying out implicit restarting and locking without the need to impose structure in every restart. In conclusion, the efficiency and properties of the algorithm are illustrated with two large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Asymptotic Representation for the Eigenvalues of a Non-selfadjoint Operator Governing the Dynamics of an Energy Harvesting Model

We consider a well known model of a piezoelectric energy harvester. The harvester is designed as a beam with a piezoceramic layer attached to its top face (unimorph configuration). A pair of thin perfectly conductive electrodes is covering the top and the bottom faces of the piezoceramic layer. These electrodes are connected to a resistive load. The model is governed by a system consisting of two equations. The first of them is the equation of the Euler–Bernoulli model for the transverse vibrations of the beam and the second one represents the Kirchhoff’s law for the electric circuit. Both equations are coupled due to the direct and converse piezoelectric effects. The boundary conditions for the beam equations are of clamped-free type. We represent the system as a single operator evolution equation in a Hilbert space. The dynamics generator of this system is a non-selfadjoint operator with compact resolvent. Our main result is an explicit asymptotic formula for the eigenvalues of this generator, i.e., we perform the modal analysis for electrically loaded (not short-circuit) system. We show that the spectrum splits into an infinite sequence of stable eigenvalues that approaches a vertical line in the left half plane and possibly of a finite number of unstable eigenvalues. This paper is the first in a series of three works. In the second one we will prove that the generalized eigenvectors of the dynamics generator form a Riesz basis (and, moreover, a Bari basis) in the energy space. In the third paper we will apply the results of the first two to control problems for this model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On optimizing Jacobi–Davidson method for calculating eigenvalues in low dimensional structures using eight band k · p model

The paper presents two ways of improving the Jacobi–Davidson method for calculating the eigenvalues and eigenvectors described by eight-band k · p model for quantum dots and other low dimensional structures. First, the method is extended by the application of time reversal symmetry operator. This extension allows efficient calculations of the twofold degeneracy present in the multiband k · p model and other interior eigenvalues. Second, the preconditioner for the indefinite matrix which comes from the discretization of the eight band k · p Hamiltonian is presented. The construction of this preconditioner is based on physical considerations about energy band structure in the k · p model. On the basis of two real examples, it is shown that the preconditioner can significantly shorten the time needed to calculate the interior eigenvalues, despite the fact that the memory usage of the preconditioner and Hamiltionian is comparable. Finally, some technical details for implementing the eight band k · p Hamiltonian and the eigensolver are provided.

77 NANOSCIENCE AND NANOTECHNOLOGY↗