Iterative methods for solution of linear system equations: From past to future

From MaRDI portal





The authors give an overview on iterative methods for solving large systems of linear algebraic equations. At first, classical methods for systems with a symmetric, positive definite matrix (steepest descent method and conjugate gradient method) are presented. Then, it is explained how modern iterative methods can be constructed by using the basic ideas of the classical methods. The Krylov methods GMRES and GMERR are discussed more in detail. Furthermore, the parallelization of the iterative solvers is studied. Especially, the parallel computation of the matrix-vector product, one of the basic operations in all iterative methods, is explained in detail.











This page was built for publication: Iterative methods for solution of linear system equations: From past to future

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747638)