Skip to main content
Log in

Note on matrices with a very ill-conditioned eigenproblem

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

Gives a bound for the distance of a matrix having an ill-conditioned eigenvalue problem from a matrix having a multiple eigenvalue which is generally sharper than that which has been published hitherto.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Google Scholar 

  2. Ruhe, A.: Properties of a matrix with a very ill-conditioned eigenproblem. Num. Math.15, 57–60 (1970).

    Google Scholar 

  3. Parlett, B. N., Reinsch, C.: Balancing a matrix for calculation of eigenvalues and eigenvectors. Num. Math.13, 293–304 (1969).

    Google Scholar 

  4. Wilkinson, J. H., Reinsch, C.: Handbook for automatic computation, vol. II. Linear algebra. Berlin-Heidelberg-New York: Springer 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wilkinson, J.H. Note on matrices with a very ill-conditioned eigenproblem. Numer. Math. 19, 176–178 (1972). https://doi.org/10.1007/BF01402528

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01402528

Keywords

Navigation