A new version of successive approximations method for solving Sylvester matrix equations

Applied Mathematics and Computation

Volumn 186, Issue 1, 2007, Pages 638-645

  Kaabi, A ^a   Kerayechian, A ^a   Toutounian, F ^a  

^a FERDOWSI UNIVERSITY OF MASHHAD   (Iran)

Author keywords

Block GMRES Sylvester method; Field of values; Successive approximations method; Sylvester matrix equations

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

APPROXIMATIONS METHOD; POSITIVE DEFINITE MATRICES; SYLVESTER MATRIX EQUATIONS;

NONLINEAR EQUATIONS;

EID: 33947240366     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.08.007     Document Type: Article

References (22)

1. Axelsson O. Iterative Solution Methods (1996), Cambridge University Press
2. Bartels R.H., and Stewart G.W. Algorithm 432. Solution of matrix equation AX + XB = C. Comm. ACM 15 (1972) 820-826
3. Datta B.N., and Datta K. Theoretical and computational aspects of some linear algebra problems in control theory. In: Byrnes C.I., and Lindquist A. (Eds). Computational and Combinatorial Methods in Systems Theory (1986), Elsevier, Amsterdam 201-212
4. Eiermann M. Fields of values and iterative methods. Linear Algebra Appl. 180 (1993) 167-197
5. Enright W.H. Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations. ACM Trans. Math. Softw. 4 (1978) 127-136
6. Galligani E. Solution of the Sylvester equations on parallel computer. Parallel Comput. (1996) 189-195
7. Goulb G.H., Nash S., and Van Loan G.F. A Hessenberg-Schur method for the problem AX - XB = C. IEEE Trans. Automat. Control AC 24 (1979) 909-913
8. Golub G.H., and Van Loan C.F. Matrix Computations. second ed. (1989), Johns Hopkins University Press, Baltimore
9. Greenbaum A. Iterative Methods for Solving Linear Systems (1997), SIAM, Philadelphia
10. El Guennouni A., jbilou K., and Riquet J. Block Krylov subspace methods for solving large Sylvester equations. Numer. Algorithms 29 (2002) 75-96
11. Gustafson K.E., and Rao D.K.M. Numerical Range, The Fields of Values of Linear Operators and Matrices (1995), Springer
12. Hewer G., and Kenny C. The sensitivity of stable Lyapunov equation. SIAM. J. Control Optim. 26 (1998) 321-344
13. Hu D.Y., and Reichel L. Krylov-subspace methods for the Sylvester equations. Linear Algebra Appl. 172 (1992) 283-313
14. Kaebi A., Kerayehchian A., and Toutounian F. Approximate inverse preconditioner by computing approximate solution of Sylvester equations. Appl. Math. Comput. 170 (2005) 1067-1076
15. Lancaster P. Explicit solutions of linear matrix equation. SIAM Rev. 12 (1970) 544-566
16. P.H. Petkov, N.D. Christov, Solving Lyapunov and Sylvester matrix equations with condition and accuracy estimates. Technical report, Department of Automechanics, Technical University of Sofia, 1756 Sofia, Bulgaria, April 12, 1996.
17. Robbe M., and Sadkane M. A convergence analysis of GMRES and FOM methods for Sylvester equations. Numer. Algorithms 30 (2002) 71-89
18. Saad Y., and Schultz M.H. GMRES, A generalized minimal residual algorithm for nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7 (1986) 856-869
19. Simoncini V. On the numerical solution of AX - XB = C. BIT 366 (1996) 181-193
20. Starke G. Fields of values and the ADI method for non-normal matrices. Linear Algebra Appl. 180 (1993) 199-218
21. C.F. Van loan, The ubiquitous Kroneker product, Department of Computer Science, Cornell university, Ithaca, New York, 14853.
22. Wachspress E.L. In: Kincaid D.R., and Hayes L.J. (Eds). The ADI Minimax Problem for Complex Spectra in Iterative Methods for Large Linear System (1990), Academic, San Diego 251-271