Advertisement

Simultaneous Iteration Method for Symmetric Matrices

  • H. Rutishauser
Part of the Die Grundlehren der mathematischen Wissenschaften book series (GL, volume 186)

Abstract

The “ordinary” iteration method with one single iteration vector (sometimes called v. Mises-Geiringer iteration) can often yield an eigenvector and its eigenput value in very short time. But since this cannot be guaranteed, not even with improvements such as shifts of origin, Aitken-Wynn acceleration or Richardson’s purification, the method cannot be recommended for general use. In order to prevent possible poor convergence, the computation is carried in parallel with several iteration vectors, between which an orthogonality relation is maintained.

Keywords

Iteration Step Acceptance Test Rayleigh Quotient Jacobi Method Roundoff Error 
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.
    Barth, W., Martin, R. S., Wilkinson, J. H.: Calculation of the eigenvalues of a symmetric tridiagonal matrix by the bisection method. Numer. Math. 9, 386–393 (1967). Cf. II/5.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bauer, F. L.: Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme. Z. Angew. Math. Phys. 8, 214–235 (1957).MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Bowdler, H., Martin, R. S., Reinsch, C, Wilkinson, J. H.: The QL and QR algorithms for symmetric matrices. Numer. Math. 11, 293–306 (1968). Cf. II/3.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Engeli, M., Ginsburg, Th., Rutishauser, H., Stiefel, E.: Refined iterative methods for computing of the solution and the eigenvalues of self adjoint boundary value problems. Mitteilung Nr. 8 aus dem Institut für angewandte Mathematik der ETH, Zürich. Basel: Birkhäuser 1959.Google Scholar
  5. 5.
    Jennings, A.: A direct method for computing latent roots and vectors of a symmetric matrix. Proc. Cambridge Philos. Soc. 63, 755–765 (1967).MathSciNetzbMATHCrossRefGoogle Scholar
  6. 6.
    Läuchli, P., Waldburger, H.: Berechnung von Beulwerten mit Hilfe von Mehrput stellenoperatoren. Z. Angew. Math. Phys. 11, 445–454 (1960).MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Martin, R. S., Reinsch, C, Wilkinson, J.H.: Householder tridiagonalisation of a symmetric matrix. Numer. Math. 11, 181–195 (1968). Cf. II/2.MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Rutishauser, H.: Lineares Gleichungssystem mit symmetrischer positiv definiter Bandmatrix nach Cholesky. Computing 1, 77–78 (1966).CrossRefGoogle Scholar
  9. 9.
    Rutishauser, H. The Jacobi method for real symmetric matrices. Numer. Math. 9, 1–10 (1966). Cf. II/l.MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Rutishauser, H.Description of Algo. 60 (Handbook of automatic computation, Vol. la). Berlin-Heidelberg-New York: Springer 1967.Google Scholar
  11. 11.
    Rutishauser, H. Computational aspects of F. L. Bauer’s simultaneous iteration method. Numer. Math. 13, 4–13 (1969).zbMATHCrossRefGoogle Scholar
  12. 12.
    Schwarz, H. R.: Matrizen-Numerik. Stuttgart: Teubner 1968.Google Scholar
  13. 13.
    Stuart, G. W.: Accelerating the orthogonal iteration for the eigenvalues of a Hermitian matrix. Numer. Math. 13, 362–376 (1969).MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1971

Authors and Affiliations

  • H. Rutishauser

There are no affiliations available

Personalised recommendations