Abstract
This paper presents preconditioned Galerkin and minimal residual algorithms for the solution of Sylvester equations AX − XB = C. Given two good preconditioner matrices M and N for matrices A and B, respectively, we solve the Sylvester equations MAXN − MXBN = MCN. The algorithms use the Arnoldi process to generate orthonormal bases of certain Krylov subspaces and simultaneously reduce the order of Sylvester equations. Numerical experiments show that the solution of Sylvester equations can be obtained with high accuracy by using the preconditioned versions of Galerkin and minimal residual algorithms and this versions are more robust and more efficient than those without preconditioning.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
