Quasi-Kernel Polynomials and Convergence Results for Quasi-Minimal Residual Iterations
Quasi-Kernel Polynomials and Convergence Results for Quasi-Minimal Residual Iterations
Recently, Freund and Nachtigal [9] have proposed a novel polynomial-based iteration, the quasi-minimal residual algorithm (QMR), for solving general nonsingular non-Hermitian linear systems. Motivated by the QMR method, in [6] we have introduced the general concept of quasi-kernel polynomials, and we have shown that the QMR algorithm is based on …