| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4633181 | Applied Mathematics and Computation | 2008 | 8 Pages |
Abstract
In the present paper, we propose a Krylov subspace method for solving large and sparse generalized Sylvester matrix equations. The proposed method is an iterative projection method onto matrix Krylov subspaces. As a particular case, we show how to adapt the ILU and the SSOR preconditioners for solving large Sylvester matrix equations. Numerical examples and applications to some PDE’s will be given.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
A. Bouhamidi, K. Jbilou,