Abstract
The solution of complex symmetric indefinite systems of equations where multiple solutions are required is considered. The quasi-minimum residual (QMR) method, ideally suited for these matrices, is generalized using the block Lanczos algorithm to solve multiple solutions simultaneously. This modification alone is shown, through numerical examples involving large sparse matrices from finite element discretization of Maxwell’s equations, to accelerate the convergence by a factor almost as great as the number of simultaneous solutions. A natural convergence criterion for this method is presented that is shown to be as effective as, and easier to compute than, the usual equation residual. Finally, a numerical comparison of the classical incomplete Cholesky and a variant of the ILU(T) preconditioners is given showing superior performance by the latter.
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.
