Abstract
We describe Galerkin and minimal residual algorithms for the solution of Sylvester's equation AX – XB = C. The algorithms use Krylov subspaces forwhich orthogonal bases are generated by the Arnoldi process. For certain choices of Krylov subspaces the computation of the solution splits into the solution of many independent subproblems. This makes the algorithms suitable for implementation on parallel computers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.