An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
Author(s) -
Roland W. Freund,
Noël M. Nachtigal
Publication year - 1994
Publication title -
siam journal on scientific computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.674
H-Index - 147
eISSN - 1095-7197
pISSN - 1064-8275
DOI - 10.1137/0915022
Subject(s) - lanczos resampling , krylov subspace , linear subspace , lanczos algorithm , mathematics , term (time) , basis (linear algebra) , linear system , generalized minimal residual method , algorithm , hermitian matrix , linear algebra , subspace topology , residual , iterative method , algebra over a field , eigenvalues and eigenvectors , physics , quantum mechanics , pure mathematics , mathematical analysis , geometry
Recently, we proposed a new Krylov subspace iteration, the quasi-minimal residual algorithm (QMR) [1], for solving general nonsingular non-Hermitian systems of linear equations $$ Ax = b $$ (1) .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom