Skip to main content

Spectral portrait of matrices by block diagonalization

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (WNAA 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1196))

Included in the following conference series:

Abstract

We first describe an algorithm that reduces a matrix A to a block diagonal form using only well conditioned transformations. The spectral properties of A are then carried out from the resulting block diagonal matrix. We show in particular that the spectral portrait of A can be obtained cheaply from that of the block diagonal matrix.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bavely, C. A., Stewart, G. W.: An algorithm for computing reducing subspaces by block diagonalization. SIAM J. Numer. Anal. Vol. 16, No. 2, (1979) 359–367.

    Google Scholar 

  2. Godunov, S. K.: Spectral portrait of matrices and criteria of spectrum dichotomy. In Computer arithmetic and enclosure methods, J. Herzberger and L. Athanassova, eds., Oldenburg, 1991, North-Holland.

    Google Scholar 

  3. Demmel, J.: The condition number of equivalence transformations that block diagonalize matrix pencils. SIAM J. Numer. Anal. Vol. 20, No. 3, (1983) 599–610

    Google Scholar 

  4. Demmel, J. W.: Computing stable eigendecompositions of matrices. Lin. Alg. Applic, 79 (1986) 163–193.

    Google Scholar 

  5. Golub, G. H., Van Loan, C. F.: Matrix computations, 2nd ed., The Johns Hopkins University Press, Baltimore, 1989.

    Google Scholar 

  6. Golub, G. H., Wilkinson, J. H.: Ill-conditioned eigensystems and the computation of the Jordan canonical form. SIAM Review, Vol. 18, No. 4, (1976) 578–619.

    Google Scholar 

  7. Horn, R. A.,Johnson, C. R.: Topics in matrix analysis. Cambridge University Press, Cambridge, 1991.

    Google Scholar 

  8. Kågström, Bo., Ruhe, Axel.: An algorithm for numerical computation of the Jordan normal form of a complex matrix. ACM Trans. Math. Soft. Vol. 6, No. 3, (1980) (1979) 398–419.

    Google Scholar 

  9. Trefethen, L. N.: Pseudospectra of matrices. In Numerical analysis 1991, D. F. Griffiths and G. A. Watson, eds., Longman, New York, 1992.

    Google Scholar 

  10. Trefethen, L. N.: Pseudospectra of linear operators. In ICIAM'95: Proceedings of the third international congress on industrial and applied mathematics. Akademie-Verlag, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lubin Vulkov Jerzy Waśniewski Plamen Yalamov

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lavallée, P.F., Malyshev, A., Sadkane, M. (1997). Spectral portrait of matrices by block diagonalization. In: Vulkov, L., Waśniewski, J., Yalamov, P. (eds) Numerical Analysis and Its Applications. WNAA 1996. Lecture Notes in Computer Science, vol 1196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62598-4_103

Download citation

  • DOI: https://doi.org/10.1007/3-540-62598-4_103

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62598-8

  • Online ISBN: 978-3-540-68326-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics