Search NASA⌕ Search

SEARCH · Search NASA

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 19 records

The Eigenvector-Eigenvalue Identity and other pragmatic topics in linear algebra for physicists

Diagonalization of an Hermitian matrix is a common task in physics. All of us have diagonalized 2x2 matrices but few have diagonalized a 3x3 matrix algebraically except in special simplifying cases. In this colloquium, I will discuss the mathematics and methods for diagonalizing small, but larger than 2x2 marices, and discuss the recently rediscovered Eigenvector-Eigenvalue identity. As an explicit, pragmatic example I will use the propagation of neutrino's propagating through matter which is inherently a 3x3 problem.

Parke, Stephen [Fermilab] (ORCID:0000000320286782)↗

Novel Approach for Calculation and Analysis of Eigenvalues and Eigenvectors in Microgrids: Preprint

This paper proposes a novel approach based on matrix perturbation theory to calculate and analyze eigenvalues and eigenvectors in a microgrid system. Rigorous theoretical analysis to solve eigenvalues and the corresponding eigenvectors for a system under various perturbations caused by fluctuations of irradiance, wind speed, or loads is presented. A computational flowchart is proposed for the unified solution of eigenvalues and eigenvectors in microgrids, and the effectiveness of the matrix perturbation-based approach in microgrids is verified by numerical examples on a typical low-voltage microgrid network.

17 WIND ENERGY↗

Eigenvalue and eigenvector sensitivity and approximate analysis for repeated eigenvalue problems

A set of computationally efficient equations for eigenvalue and eigenvector sensitivity analysis are derived, and a method for eigenvalue and eigenvector approximate analysis in the presence of repeated eigenvalues is presented. The method developed for approximate analysis involves a reparamaterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations of changes in both the eigenvalues and eigenvectors associated with the repeated eigenvalue problem. Examples are given to demonstrate the application of such equations for sensitivity and approximate analysis.

Hou, Gene J. W.↗

Data-Driven Distributed Algorithms for Estimating Eigenvalues and Eigenvectors of Interconnected Dynamical Systems

Here, the paper presents data-driven algorithms to estimate in a distributed manner the eigenvalues, right and left eigenvectors of an unknown linear (or linearized) interconnected dynamic system. In particular, the proposed algorithms do not require the identification of the system model in advance before performing the estimation. As a first step, we consider interconnected dynamical system with distinct eigenvalues. The proposed strategy first estimates the eigenvalues using the well-known Prony method. The right and left eigenvectors are then estimated by solving distributively a set of linear equations. One important feature of the proposed algorithms is that the topology of communication network used to perform the distributed estimation can be chosen arbitrarily, given that it is connected, and is also independent of the structure or sparsity of the system (state) matrix. The proposed distributed algorithms are demonstrated via a numerical example.

97 MATHEMATICS AND COMPUTING↗

CAVE3: A general transient heat transfer computer code utilizing eigenvectors and eigenvalues

The method of solution is a hybrid analytical numerical technique which utilizes eigenvalues and eigenvectors. The method is inherently stable, permitting large time steps even with the best of conductors with the finest of mesh sizes which can provide a factor of five reduction in machine time compared to conventional explicit finite difference methods when structures with small time constants are analyzed over long time periods. This code will find utility in analyzing hypersonic missile and aircraft structures which fall naturally into this class. The code is a completely general one in that problems involving any geometry, boundary conditions and materials can be analyzed. This is made possible by requiring the user to establish the thermal network conductances between nodes. Dynamic storage allocation is used to minimize core storage requirements. This report is primarily a user's manual for CAVE3 code. Input and output formats are presented and explained. Sample problems are included which illustrate the usage of the code as well as establish the validity and accuracy of the method.

Palmieri, J. V.↗

On the eigenvalue and eigenvector derivatives of a general matrix

The existence of differentiable eigenvalues and eigenvectors for a general matrix is addressed. The eigenspace which contains differentiable eigenvectors is determined and computed by using the concept of subspace intersection in conjunction with the singular value decomposition algorithm. The differentiable eigenvectors associated with repeated eigenvalues should be simultaneously the eigenvectors of the general matrix and its corresponding sensitivity matrix. Furthermore, the derivatives for differentiable eigenvectors associated with repeated eigenvalues can be computed using higher order derivatives of the matrix, whereas the corresponding eigenvalue derivatives are the eigenvalues of the sensitivity matrix.

Juang, Jer-Nan↗

Observations on the Computation of Eigenvalue and Eigenvector Jacobians

Many scientific and engineering problems benefit from analytic expressions for eigenvalue and eigenvector derivatives with respect to the elements of the parent matrix. While there exists extensive literature on the calculation of these derivatives, which take the form of Jacobian matrices, there are a variety of deficiencies that have yet to be addressed — including the need for both left and right eigenvectors, limitations on the matrix structure, and issues with complex eigenvalues and eigenvectors. This work addresses these deficiencies by proposing a new analytic solution for the eigenvalue and eigenvector derivatives. The resulting analytic Jacobian matrices are numerically efficient to compute and are valid for the general complex case. It is further shown that this new general result collapses to previously known relations for the special cases of real symmetric matrices and real diagonal matrices. Finally, the new Jacobian expressions are validated using forward finite differencing and performance is compared with another technique.

Jacobian↗

Derivatives of eigenvalues and eigenvectors for a general matrix

Expressions are obtained for the derivatives of the eigenvalues and eigenvectors which are expressions of only one left-hand and one right-hand eigenvector. The approach described makes use of a Choleski decomposition or some other decomposition method. The method may be extended to find any order of derivative of the eigenvalue and eigenvector. The expressions obtained for finding the derivatives of eigenvalues and eigenvectors for nonself-adjoint systems may be applied to self-adjoint systems.

Rudisill, C. S.↗

Numerical methods for evaluating the derivatives of eigenvalues and eigenvectors

Two numerical methods are presented for computing the derivatives of eigenvalues and eigenvectors which do not require complete solution of the eigenvalue problem if only a few derivatives are sought. The 'iterative' method may be used to find the first derivative of one or all of the eigenvectors together with the second derivative of their eigenvalues in a self-adjoint system. If the left- and right-hand eigenvectors are known, the first derivative of the eigenvector corresponding to the largest eigenvalue and the second derivative of the largest eigenvalue may be obtained for a nonself-adjoint system. The 'algebraic' method may be used to find all orders of the derivatives, provided they exist, without requiring the left-hand eigenvectors.

Rudisill, C. S.↗

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↗

On the eigenvalue and eigenvector derivatives of a non-defective matrix

A novel approach is introduced to address the problem of existence of differentiable eigenvectors for a nondefective matrix which may have repeated eigenvalues. The existence of eigenvector derivatives for a unique set of continuous eigenvectors corresponding to a repeated eigenvalue is rigorously established for nondefective and analytic matrices. A numerically implementable method is then developed to compute the differentiable eigenvectors associated with repeated eigenvalues. The solutions of eigenvalue and eigenvector derivatives for repeated eigenvalues are then derived. An example is given to illustrate the validity of formulations developed in this paper.

Juang, Jer-Nan↗

Eigenvalues and eigenvectors of the staggered Dirac operator at finite temperature

We examine the eigenvalues and eigenvectors of the staggered Dirac operator on thermal ensembles created in QCD with two flavors of staggered quarks. We see that across the phase transition a gap opens in the spectrum. For finite volume lattices in the low-temperature phase the eigenvectors are extended, but generic field configurations in the high temperature phase give rise to localized eigenstates. We examine measures of the stability of such localization and find that at finite volumes localization occurs through Mott's mechanism of the formation of mobility edges. However, the band gap between the localized and extended states seem to scale to zero in the limit of large volume.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗