Skip to main content

Fast Verification for Respective Eigenvalues of Symmetric Matrix

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3718))

Included in the following conference series:

Abstract

A fast verification algorithm of calculating guaranteed error bounds for all approximate eigenvalues of a real symmetric matrix is proposed. In the proposed algorithm, Rump’s and Wilkinson’s bounds are combined. By introducing Wilkinson’s bound, it is possible to improve the error bound obtained by the verification algorithm based on Rump’s bound with a small additional cost. Finally, this paper includes some numerical examples to show the efficiency of the proposed algorithm.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ANSI/IEEE: IEEE Standard for Binary Floating-Point Arithmetic: ANSI/IEEE Std 754-1985. IEEE, New York (1985)

    Google Scholar 

  2. Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. The Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  3. Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM Publications, Philadelphia (2002)

    Book  MATH  Google Scholar 

  4. Ipsen, I.C.F.: Relative Perturbation Bounds for Matrix Eigenvalues and Singular Values. Acta Numerica 7, 151–201 (1998)

    Article  MathSciNet  Google Scholar 

  5. Miyajima, S., Ogita, T., Ozaki, K., Oishi, S.: Fast error estimation for eigenvalues of symmetric matrix without directed rounding. In: Proc. 2004 International Symposium on Nonlinear Theory and its Applications, Fukuoka, Japan, pp. 167–170 (2004)

    Google Scholar 

  6. Oishi, S.: Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation. Linear Alg. Appl. 324, 133–146 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Parlett, B.N.: The Symmetric Eigenvalue Problem. Classics in Applied Mathematics 20. SIAM Publications, Philadelphia (1997)

    Google Scholar 

  8. Rump, S.M.: Computational error bounds for multiple or nearly multiple eigenvalues. Linear Alg. Appl. 324, 209–226 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rump, S.M.: Private communication (2004)

    Google Scholar 

  10. Rump, S.M., Zemke, J.: On eigenvector bounds. BIT 43, 823–837 (2004)

    Article  MathSciNet  Google Scholar 

  11. Stewart, G.W., Sun, J.-G.: Matrix Perturbation Theory. Academic Press, New York (1990)

    MATH  Google Scholar 

  12. The MathWorks Inc.: MATLAB User’s Guide Version 7 (2004)

    Google Scholar 

  13. Wilkinson, J.H.: Rigorous error bounds for computed eigensystem. Computer J. 4, 230–241 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  14. Yamamoto, T.: Error bounds for computed eigenvelues and eigenvectors. Numer. Math. 34, 189–199 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miyajima, S., Ogita, T., Oishi, S. (2005). Fast Verification for Respective Eigenvalues of Symmetric Matrix. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2005. Lecture Notes in Computer Science, vol 3718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11555964_26

Download citation

  • DOI: https://doi.org/10.1007/11555964_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28966-1

  • Online ISBN: 978-3-540-32070-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics