# Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra

@article{Denton2019EigenvectorsFE,
title={Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra},
author={Peter B. Denton and Stephen J. Parke and Terence Tao and Xining Zhang},
journal={arXiv: Rings and Algebras},
year={2019}
}
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… Expand
43 Citations

#### Figures from this paper

Finding Eigenvectors: Fast and Nontraditional Approach.
Diagonalizing a matrix $A$, that is finding two matrices $P$ and $D$ such that $A = PDP^{-1}$ with $D$ being a diagonal matrix needs two steps: first find the eigenvalues and then find theExpand
New bounds on the spectral radius of graphs based on the moment problem
• Mathematics
• 2019
Let $\mathcal{G}$ be an undirected graph with adjacency matrix $A$ and spectral radius $\rho$. Let $w_k, \phi_k$ and $\phi_k^{(i)}$ be, respectively, the number walks of length $k$, closed walks ofExpand
Analytical solutions to some generalized and polynomial eigenvalue problems
Abstract It is well-known that the finite difference discretization of the Laplacian eigenvalue problem −Δu = λu leads to a matrix eigenvalue problem (EVP) Ax =λx where the matrix A isExpand
Approximate Generalized Inverses with Iterative Refinement for ε-Accurate Preconditioning of Singular Systems
• Mathematics, Computer Science
• ArXiv
• 2020
The robustness of HIF and HIFIR are demonstrated and it is shown that they improve both accuracy and efficiency of the prior state of the art by orders of magnitude for systems with up to a million unknowns. Expand
Eigenvectors and eigenvalues: a new formula?
• Mathematics
• 2020
There has recently been an intense discussion about the (re)discovery of a formula that relates the components of an orthonormal basis of eigenvectors of an Hermitian matrix A of order n to theExpand
Recovery of eigenvectors from eigenvalues in systems of coupled harmonic oscillators
• Physics
• 2020
The eigenvector-eigenvalue identity relates the eigenvectors of a Hermitian matrix to its eigenvalues and the eigenvalues of its principal submatrices in which the jth row and column have beenExpand
Wavefunctions from energies: Applications in simple potentials
• Physics
• Journal of Mathematical Physics
• 2020
A remarkable mathematical property -- somehow hidden and recently rediscovered -- allows obtaining the eigenvectors of a Hermitian matrix directly from their eigenvalues. That opens the possibilityExpand
More on the eigenvectors-from-eigenvalues identity
Using the notion of a higher adjugate of a matrix, we generalize the eigenvector-eigenvalue formula surveyed recently by Denton, Parke, Tao and Zhang to arbitrary square matrices over $\mathbb{C}$Expand
Analytical solutions to some generalized matrix eigenvalue problems
• Q. Deng
• Mathematics, Computer Science
• ArXiv
• 2020
The eigenvector-eigenvalue identity is generalized for GMEVPs and some trigonometric identities are derived and possible generalizations and applications to the design of better numerical methods for solving partial differential equations are discussed. Expand
Eigenvectors from eigenvalues: the case of one-dimensional Schrödinger operators
• Mathematics
• 2020
We revisit an archive submission by P. B. Denton, S. J. Parke, T. Tao, and X. Zhang, arXiv:1908.03795, on $n \times n$ self-adjoint matrices from the point of view of self-adjoint DirichletExpand

#### References

SHOWING 1-10 OF 77 REFERENCES
Graph eigenvectors, fundamental weights and centrality metrics for nodes in networks
The set of such nodal centrality metrics, the squared eigenvector components of the adjacency matrix over all eigenvalue $\lambda_{k}$ for each node $j$, is 'ideal' in the sense of being complete, uncorrelated and mathematically precisely defined and computable. Expand
Corank-1 projections and the randomised Horn problem
• Mathematics, Physics
• 2019
Let $\hat{\boldsymbol x}$ be a normalised standard complex Gaussian vector, and project an Hermitian matrix $A$ onto the hyperplane orthogonal to $\hat{\boldsymbol x}$. In a recent paper FarautExpand
When can perfect state transfer occur
Let $X$ be a graph on $n$ vertices with with adjacency matrix $A$ and let $H(t)$ denote the matrix-valued function $\exp(iAt)$. If $u$ and $v$ are distinct vertices in $X$, we say perfect stateExpand
Semicircle law on short scales and delocalization of eigenvectors for Wigner random matrices
• Physics, Mathematics
• 2009
We consider $N\times N$ Hermitian random matrices with i.i.d. entries. The matrix is normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. We study theExpand
On the eigenvalues of principal submatrices of normal, hermitian and symmetric matrices
• Mathematics
• 1993
Let λ1…λ n be distinct complex numbers and let λ i1…λ in−1 ,i= 1,…n, be complex numbers, not necessarily distinct. We show that the problem of determining when a normal n × n matrix A existsExpand
State transfer in strongly regular graphs with an edge perturbation
• Computer Science, Mathematics
• J. Comb. Theory, Ser. A
• 2020
It is shown that, for every strongly regular graph, there is some perturbation which results in pretty good state transfer, and for any strongly regular graphs, that $\phi(X\setminus e)$ does not depend on the choice of e. Expand
Error bounds in the Rayleigh-Ritz approximation of eigenvectors
The most common method of approximating Lhe eigenvalues XI ::; X2 ::; •• • of a symmetriclinear operator A is the Rayleigh-Ritz method [1,5 ,19P This reduces an eigenvalue problem on a space of aExpand
Two new graph-theoretical methods for generation of eigenvectors of chemical graphs
• Mathematics
• 1989
Two new graph-theoretical methods, (A) and (B), have been devised for generation of eigenvectors of weighted and unweighted chemical graphs. Both the methods show that not only eigenvalues but alsoExpand
Finite-Dimensional Vector Spaces
As a newly minted Ph.D., Paul Halmos came to the Institute for Advanced Study in 1938--even though he did not have a fellowship--to study among the many giants of mathematics who had recently joinedExpand
Some results on graph spectra
Abstract This paper presents a variety of results on graph spectra. The number of main eigenvalues of a graph is shown to be equal to the rank of an associated matrix. We establish a condition for aExpand