On the numerical solution of AX - XB = C

BIT Numerical Mathematics

Volumn 36, Issue 4, 1996, Pages 814-830

  Simoncini, V ^a,b  

^a CNR   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Arnoldi; Iterative methods; Krylov subspace; Matrix polynomials; Perturbation theory; Sylvester equation

Indexed keywords

EID: 0000844938     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01733793     Document Type: Article

References (26)

1. R. H. Bartels and G. W. Stewart, Algorithm 432: Solution of the matrix equation AX + XB = C, Comm. ACM, 15 (1972), pp. 820-826.
2. D. L. Boley, Krylov space methods on state-space control models, Circ. Syst. & Signal Proc., 13 (1994), pp. 733-758.
3. F. Chatelin, Valeurs Propres de Matrices, Masson, Paris, 1988.
4. J. Demmel, Computing stable eigendecomposition of matrices, Linear Algebra Appl., 79 (1986), pp. 163-193.
5. E. de Souza and S. P. Bhattacharyya, Controllability, observability and the solution of AX - XB = C, Linear Algebra Appl., 39 (1981), pp. 167-188.
6. R. W. Freund, A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems, SIAM J. Sci. Cornput., 14 (1993), pp. 470-482.
7. I. Gohberg, L. Rodman, and P. Lancaster, Matrix Polynomials, Academic Press, New York, 1982.
8. G. H. Golub, S. Nash, and C. Van Loan, A Hessenberg-Schur method for the problem AX + XB = C, IEEE Trans. Autom. Contr., AC-24 (1979), pp. 909-913.
9. R. E. Hartwig, Resultants and the solution of AX - XB = -C, SIAM J. Appl. Math., 23 (1972), pp. 104-117.
10. J. Z. Hearon, Nonsingular solutions of TA - BT = C, Linear Algebra Appl., 16 (1977), pp. 57-63.
11. N. J. Higham, Perturbation theory and backward error for AX - XB = C, BIT, 33 (1993), pp. 124-136.
12. N. J. Higham, The Test Matrix Toolbox for Matlab, Tech. Report 237, Manchester Centre for Computational Mathematics, University of Manchester, UK, 1993.
13. M. Hochbruck and G. Starke, Preconditioned Krylov subspace methods for Lyapunov matrix equations, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 156-171.
14. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1991.
15. D. Y. Hu and L. Reichel, Krylov subspace methods for the Sylvester equation, Linear Algebra Appl., 174 (1992), pp. 283-314.
16. I. M. Jaimoukha and E. M. Kasenally, Krylov subspace methods for solving large Lyapunov equations, SIAM J. Numer. Anal., 31 (1994), pp. 227-251.
17. E. C. Ma, A finite series solution of the matrix equation AX - XB = C, J. SIAM Appl. Math, 14 (1966), pp. 490-495.
18. N. M. Nachtigal, L. Reichel, and L. N. Trefethen, A hybrid GMRES algorithm for nonsymmetric matrix iterations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 796-825.
19. V. M. Popov, Invariant description of linear, time-invariant controllable systems, SIAM J. Control, 10 (1972), pp. 252-264.
20. Y. Saad, Numerical solution of large Lyapunov equations, in Signal Processing, Scattering, Operator Theory, and Numerical Methods. Proceedings of the international symposium MTNS-89, vol III, M. A. Kaashoek, J. H. van Schuppen, and A. C. Ran, eds., Boston, 1990, Birkhauser, pp. 503-511.
21. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Halstead Press, New York, 1992.
22. V. Simoncini and M. Sadkane, Arnoldi-Riccati method for large eigenvalue problems, BIT, 36 (1996), pp. 578-593.
23. R. A. Smith, Matrix calculation for Liapunov quadratic forms, J. Differential Equations, 2 (1966), pp. 208-217.
24. G. Starke and W. Niethammer, SOR for AX - XB = C, Linear Algebra Appl., 154-156 (1991), pp. 355-375.
25. J. M. Varah, On the separation of two matrices. Linear Algebra Appl., (1979), pp. 216-222.
26. H. K. Wimmer, Linear matrix equations, controllability and observability, and the rank of solutions, SIAM J. Matrix Anal., 8 (1988), pp. 570-578.