A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- 1 March 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 14 (2) , 470-482
- https://doi.org/10.1137/0914029
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian MatricesSIAM Journal on Scientific Computing, 1993
- Quasi-Kernel Polynomials and Convergence Results for Quasi-Minimal Residual IterationsPublished by Springer Nature ,1992
- Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient MatricesSIAM Journal on Scientific and Statistical Computing, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991
- Avoiding breakdown in the CGS algorithmNumerical Algorithms, 1991
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Iterative Solution of Linear Equations in ODE CodesSIAM Journal on Scientific and Statistical Computing, 1983
- Conjugate gradient methods for indefinite systemsLecture Notes in Mathematics, 1976
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952
- An iteration method for the solution of the eigenvalue problem of linear differential and integral operatorsJournal of Research of the National Bureau of Standards, 1950