Using least-squares to find an approximate eigenvector

DOI10.13001/1081-3810.1186MaRDI QIDQ3497876zbMATH OpenOpenAlexFDO

Authors David Hecker, Deborah Lurie

Publication date 28 May 2008

Published in The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117006, https://semanticscholar.org/paper/06ed047c7f05e6b5dc05d7babbf2230d452876d1

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

approximate eigenvectoreigenvalue errorempirical resultsestimatesleast-squares method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• On the Least Squares Solution of Inverse Eigenvalue Problems
• The least squares and line search in extracting eigenpairs in Jacobi-Davidson method
• The least squares method can be misleading
• scientific article; zbMATH DE number 4026670
• Discrete least-squares technique for eigenvalues. I: The one-dimensional case

Cited in

(2)

• A fixed point theorem in n-Banach spaces and Ulam stability
• A fixed point theorem and Ulam stability of a general linear functional equation in random normed spaces

This page was built for publication: Using least-squares to find an approximate eigenvector

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497876)