On the vector epsilon algorithm for solving linear systems of equations
Graves-Morris, Peter R. Salam, A.
Graves-Morris, Peter R.
Salam, A.
Publication Date
2009-05-12T16:17:08Z
End of Embargo
Supervisor
Rights
Peer-Reviewed
Yes
Open Access status
Accepted for publication
Institution
Department
Awarded
Embargo end date
Additional title
Abstract
The four vector extrapolation methods, minimal polynomial extrapolation, reduced rank extrapolation, modified minimal polynomial extrapolation and the topological epsilon algorithm, when applied to linearly generated vector sequences are Krylov subspace methods and it is known that they are equivalent to some well-known conjugate gradient type methods. However, the vector -algorithm is an extrapolation method, older than the four extrapolation methods above, and no similar results are known for it. In this paper, a determinantal formula for the vector -algorithm is given. Then it is shown that, when applied to a linearly generated vector sequence, the algorithm is also a Krylov subspace method and for a class of matrices the method is equivalent to a preconditioned Lanczos method. A new determinantal formula for the CGS is given, and an algebraic comparison between the vector -algorithm for linear systems and CGS is also given.
Version
No full-text available in the repository
Citation
Graves-Morris, P. R., Salam, A.(2002).On the vector epsilon algorithm for solving linear systems of equations. Numerical Algorithms, Vol. 29, no. 1-3, pp. 229-247.
Link to publisher’s version
Link to published version
Link to Version of Record
Type
Article