Advertisement

Lecture 9

  • Eugene E. Tyrtyshnikov

Abstract

“The eigenvalue problem” is a short name for a variety of settings and problems related to computing eigenvalues, eigenvectors, spectral projectors, etc.

Keywords

Characteristic Polynomial Nonsingular Matrix Unitary Matrice Spectral Projector Block Diagonal Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D.S. Watkins and L. Eisner. Convergence of algorithms of decomposition type for the eigenvalue problem. Linear Algebra Appl. 143: 19–47 (1991).MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Eugene E. Tyrtyshnikov
    • 1
  1. 1.Institute of Numerical MathematicsRussian Academy of SciencesMoscowRussia

Personalised recommendations