Skip to main content

On the reduction of a symmetric matrix to tridiagonal form

Abstract

A stable algorithm for reducing a symmetric, non-definite matrix of ordern to tridiagonal form, involving aboutn 3/6 additions and multiplications is presented.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    B. N. Parlett and J. K. Reid,On the solution of a system of linear equations whose matrix is symmetric but not definite, BIT 10, No. 3 (1970), 386–397.

    Google Scholar 

  2. 2.

    J. H. Wilkinson,The algebraic eigenvalue problem, Oxford University Press, Oxford 1965.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Aasen, J.O. On the reduction of a symmetric matrix to tridiagonal form. BIT 11, 233–242 (1971). https://doi.org/10.1007/BF01931804

Download citation

Keywords

  • Computational Mathematic
  • Symmetric Matrix
  • Stable Algorithm
  • Tridiagonal Form