Using the matrix sign function to compute invariant subspaces

SIAM Journal on Matrix Analysis and Applications

Volumn 19, Issue 1, 1998, Pages 205-225

  Bai, Zhaojun ^a   Demmel, James ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Deflating subspaces; Eigenvalue problem; Invariant subspace; Matrix sign function; Newton's method

Indexed keywords

EID: 0032338141     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896297719     Document Type: Article

References (35)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, 2nd ed., SIAM, Philadelphia, PA, 1995.
2. Z. BAI AND J. DEMMEL, Design of a parallel nonsymmetric eigenroutine toolbox, Part I, in Proc. Sixth SIAM Conference on Parallel Processing for Scientific Computing, R. F. Sincovec et al., eds., SIAM, Philadelphia, PA, 1993; also available as Computer Science Report CSD-92-718, University of California, Berkeley, CA, 1992.
3. Z. BAI AND J. DEMMEL, Design of a Parallel Nonsymmetric Eigenroutine Toolbox, Part II, Department of Mathematics Research Report 95-11, University of Kentucky, Lexington, KY, 1995.
4. Z. BAI, J. DEMMEL, J. DONGARRA, A. PETITET, H. ROBINSON, AND K. STANLEY, The spectral decomposition of nonsymmetric matrices on distributed memory parallel computers, SIAM J. Sci. Comput., 18 (1997), pp. 1446-1461.
5. Z. BAI, J. DEMMEL, AND M. GU, Inverse free parallel spectral divide and conquer algorithms for nonsymmetric eigenproblems, Numer. Math., 76 (1997), pp. 279-308.
6. S. BATTERSON, Convergence of the shifted QR algorithm on 3 by 3 normal matrices, Numer. Math., 58 (1990), pp. 341-352.
7. A. W. BOJANCZYK AND P. VAN DOOREN, Reordering diagonal blocks in real Schur form, in Linear Algebra for Large Scale and Real-Time Applications, G. H. Golub, M. S. Moonen, and B. L. R. De Moor, eds., Kluwer Academic Publishers, Amsterdam, 1993.
8. ∞-norm, Systems Control Lett., 15 (1990), pp. 1-7.
9. ∞ norm of a transfer matrix and related problems. Math. Control Signals Systems, 2 (1989), pp. 207-219.
10. A. Y. BULGAKOV AND S. K. GODUNOV, Circular dichotomy of the spectrum of a matrix, Siberian Math. J., 29 (1988), pp. 734-744.
11. R. BYERS, Solving the algebraic Riccati equation with the matrix sign function, Linear Algebra Appl., 85 (1987), pp. 267-279.
12. R. BYERS, A bisection method for measuring the distance of a stable matrix to the unstable matrices, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 875-881.
13. R. BYERS, C. HE, AND V. MEHRMANN, The Matrix Sign Function Method and the Computation of Invariant Subspaces, Technical report preprint SPC 94-25, Fakultät für Mathematik, TU Chemnitz-Zwickau, Germany, 1994.
14. R. BYERS AND N. K. NICHOLS, On the stability radius of a generalized state-space system, Linear Algebra Appl., 188-189 (1993). pp. 113-134.
15. F. CHATELIN, Simultaneous Newton's iteration for the eigenproblem, Comput. Suppl., 5 (1984), pp. 67-74.
16. D. DAY, How the QR Algorithm Fails to Converge and How to Fix It, Tech. Rep. SAND 96-09135, Sandia National Laboratories, Albuquerque, NM. 1996.
17. J. DEMMEL, The condition number of equivalence transformations that block diagonalize matrix pencils, SIAM J. Numer. Anal., 20 (1983), pp. 599-610.
18. J. DEMMEL, On condition numbers and the distance to the nearest ill-posed problem, Numer. Math., 51 (1987), pp. 251-289.
19. J. DEMMEL, Three methods for refining estimates of invariant subspaces, Computing, 38 (1987), pp. 43-57.
20. J. DONGARRA, C. MOLER, AND J. H. WILKINSON, Improving the accuracy of computed eigenvalues and eigenvectors, SIAM J. Numer. Anal., 20 (1984), pp. 46-58.
21. B. S. GARBOW, J. M. BOYLE, J. J. DONGARRA, AND C. B. MOLER, Matrix Eigensystem Routines - EISPACK Guide Extension, Lecture Notes in Comput. Sci. 51, Springer-Verlag, Berlin, 1977.
22. J. GARDINER AND A. LAUB, A generalization of the matrix-sign function solution for algebraic Riccati equations, Internat. J. Control, 44 (1986), pp. 823-832.
23. N. J. HIGHAM, The matrix sign decomposition and its relation to the polar decomposition, Linear Algebra Appl., 212/213 (1994), pp. 3-20.
24. T. KATO, Perturbation Theory for Linear Operators, 2nd ed., Springer-Verlag, Berlin, 1980.
25. C. KENNEY AND A. LAUB, Polar decomposition and matrix sign function condition estimates, SIAM J. Sci. Statist. Comput., 12 (1991), pp. 488-504.
26. C. KENNEY, A. LAUB, AND P. PAPADOPOULOS, Matrix sign function algorithms for Riccati equations, in Proc. of IMA Conference on Control: Modelling, Computation, Information, Southend-On-Sea, IEEE Press, Piscataway, NJ, 1992, pp. 1-10.
27. A. N. MALYSHEV, Guaranteed accuracy in spectral problems of linear algebra, Parts I and II, Siberian Adv. Math., 2 (1992), pp. 144-197, 153-204.
28. A. N. MALYSHEV, Parallel algorithm for solving some spectral problems of linear algebra, Linear Algebra Appl., 188/189 (1993), pp. 489-520.
29. R. MATHIAS, Condition estimation for the matrix function via the Schur decomposition, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 565-578.
30. J. ROBERTS, Linear model reduction and solution of the algebraic Riccati equation, Internat. J. Control, 32 (1980), pp. 677-687.
31. L. SHIEH, H. DIB, AND R. YATES, Separation of matrix eigenvalues and structural decomposition of large-scale systems, IEEE Proceedings: Control Theory Appl., 133 (1986), pp. 90-96.
32. B. T. SMITH, J. M. BOYLE, J. J. DONGARRA, B. S. GARBOW, Y. IKEBE, V. C. KLEMA, AND C. B. MOLER, Matrix Eigensystem Routines - EISPACK Guide, Lecture Notes in Comput. Sci. 6, Springer-Verlag, Berlin, 1976.
33. G. W. STEWART, Error and perturbation bounds for subspaces associated with certain eigenvalue problems, SIAM Rev., 15 (1973), pp. 727-764.
34. G. W. STEWART AND J.-G. SUN, Matrix Perturbation Theory, Academic Press, New York, 1990.
35. L. N. TREFETHEN, Pseudospectra of matrices, in Numerical Analysis 1991, D. F. Griffiths and G. A. Watson, eds., Longman Sci. Tech. Publ., Harlow, UK, 1992, pp. 234-266.