American Mathematical Monthly · 1998 · 140 citations · 14 references
Natural SciencesComputer ScienceMathematicsApplied MathematicsProbability TheoryScientific ComputingComputational MathematicsLinear AlgebraMatrix ComputationNumerical AlgorithmsNumerical AnalysisNumerical Linear AlgebraMathematics In Computer Science
We explain why Krylov methods make sense, and why it is natural to represent a solution to a linear system as a member of a Krylov space. In particular we show that the solution to a nonsingular linear system Ax = b lies in a Krylov space whose dimension is the degree of the minimal polynomial of A. Therefore, if the minimal polynomial of A has low degree then the space in which a Krylov method searches for the solution is small. In this case a Krylov method has the opportunity to converge fast. When the matrix is singular, however, Krylov methods can fail. Even if the linear system does have a solution, it may not lie in a Krylov space. In this case we describe the class of right-hand sides for which a solution lies in a Krylov space. As it happens, there is only a single solution that lies in a Krylov space, and it can be obtained from the Drazin inverse. Center for Research In Scientific Computation, Department of Mathematics, North Carolina State University, P. O. Box 8205, Rale...
14
Computational Methods of Linear Algebra
A. S. H., D. K. Faddeev, V. N. Faddeeva · Mathematics of Computation · 1964 · 1.6K citations
Pseudo-Inverses in Associative Rings and Semigroups
Michael P. Drazin · American Mathematical Monthly · 1958 · 698 citations