Abstract
Recently, Freund and Nachtigal proposed a novel conjugate gradient-type method, the quasi-minimal residual algorithm (QMR), for the iterative solution of general non-Hermitian systems of linear equations. The QMR method is based on the nonsymmetric Lanczos process, and thus, like the latter, QMR requires matrix-vector multiplications with both the coefficient matrix of the linear system and its transpose. However, in certain applications, the transpose is not readily available, and generally, it is desirable to trade in multiplications with the transpose for matrix-vector products with the original matrix.
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.
