Abstract
In this paper we construct an approximate solution to large Sylvester equations of the form AX+XB=CD^T. The construction uses a new variant of the block Arnoldi algorithm which exploits the near-breakdowns, that is, the near singularities in the generated basis. As a consequence, the algorithm eliminates the directions which do not contribute to the approximate solution by keeping in the generated basis only the ''active'' vectors detected by a criterion based on the residual associated with the approximate solution. The effectiveness of the proposed algorithm is demonstrated on several examples, including the case where the matrix B has a small or a large size.
Sign-in/Register to access full text options 
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.
