Solution of Systems of Linear Equations by Minimized Iterations
Abstract¶
A simple algorithm is described which is well adapted to the effective solution of large systems of linear algebraic equations by a succession of well-convergent approximations.
Summary¶
Lanczos presents a minimized-iteration scheme for solving large systems of linear algebraic equations through successively improved approximations. The work is an early Krylov-subspace formulation and an important companion to conjugate-gradient methods, especially for understanding how orthogonalization and polynomial approximations can make large linear systems tractable.
Links¶
Knowledge Base
External
Tags¶
Similar Papers¶
1
78%
2
77%
3
72%
4
68%
5
67%
An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix Is a Symmetric M-Matrix
Incomplete Cholesky Conjugate Gradient