Among the iterative methods for solving large linear systems with a sparse (or, possibly,
structured) nonsymmetric matrix, those that are based on the Lanczos process feature short …

This book on iterative methods for linear and nonlinear equations can be used as a tutorial
and a reference by anyone who needs to solve nonlinear systems of equations or large …

Computational simulation of scientific phenomena and engineering problems often depends
on solving linear systems with a large number of unknowns. This book gives insight into the …

Numerical Linear Algebra and Applications, 2nd Edition: Back Matter Page 1 page 501 i i i i
Bibliography E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du …

This paper is about GMRES algorithms for the solution of nonsingular linear systems. We
first consider basic algorithms and study their convergence. We then focus on acceleration …

Many problems in science and engineering require the solution of a long sequence of slowly
changing linear systems. We propose and analyze two methods that significantly reduce the …

The purpose of this book is to unify and document in one place many of the techniques and
much of the current understanding about solving systems of linear equations on vector and …

Krylov subspace methods (KSMs) are iterative algorithms for solving large, sparse linear
systems and eigenvalue problems. Current KSMs rely on sparse matrix-vector multiply …

This book deals with numerical methods for solving large sparse linear systems of
equations, particularly those arising from the discretization of partial differential equations. It …

A modification is given of the GMRES iterative method for nonsymmetric systems of linear
equations. The new method deflates eigenvalues using Wu and Simon's thick restarting …