Computing Eigenvectors from Eigenvalues In an Arbitrary Orthonormal Basis
John Lakness

TL;DR
This paper explores methods to compute eigenvectors from eigenvalues within arbitrary orthonormal bases, linking quadratic optimization constraints to eigenvector computation through submatrix and sub-projection eigenvalues.
Contribution
It introduces a novel approach connecting eigenvector computation to quadratic optimization constraints via submatrix and sub-projection eigenvalues.
Findings
Eigenvectors can be derived from eigenvalues of submatrices.
Eigenvalues of sub-projections relate to eigenvectors in orthonormal bases.
The method provides an alternative to traditional eigenvector computation techniques.
Abstract
The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation of eigenvectors of an orthonormal basis projection using eigenvalues of sub-projections.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques · Advanced Measurement and Metrology Techniques · Matrix Theory and Algorithms
