Study of Krylov subspace algorithm
-
Abstract
Krylov subspace methods are considered currently to be among the most important iterative techniques available for solving large-scale linear systems.These techniques are based on projection process,both orthogonal and oblique,onto Krylov subspaces.The efficient preconditioned methods will accelerate the convergence of the algorithm.This paper introduces how to solve large scale linear problems by GMRES based on LU factorizatinos.
-
-