Using least-squares to find an approximate eigenvector

@article{Hecker2007UsingLT,
  title={Using least-squares to find an approximate eigenvector},
  author={David A. Hecker and D Lurie},
  journal={Electronic Journal of Linear Algebra},
  year={2007},
  volume={16},
  pages={9}
}
The least-squares method can be used to approximate an eigenvector for a matrix when only an approximation is known for the corresponding eigenvalue. In this paper, this technique is analyzed and error estimates are established proving that if the error in the eigenvalue is sufficiently small, then the error in the approximate eigenvector produced by the least-squares method is also small. Also reported are some empirical results based on using the algorithm. 1. Notation. We use upper case… 

Figures from this paper

A note on constructive treatment of eigenvectors

In comparison to classical eigenvectors whose computation is often prone to numerical instability, a constructive treatment allows addressing the computational uncertainty in a controlled way.

A fixed point theorem in n-Banach spaces and Ulam stability

References

SHOWING 1-3 OF 3 REFERENCES

Matrix analysis

This new edition of the acclaimed text presents results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrates their importance in a variety of applications.

Elementary Linear Algebra

Matrix Analysis Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society

  • Matrix Analysis Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society
  • 1985