An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems (Q1112558)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems |
scientific article |
Statements
An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems (English)
0 references
1988
0 references
This paper completes and further extends the joint work of the author with \textit{E. P. Papadopoulou} and \textit{T. S. Papatheodorou} [SIAM J. Numer. Anal. (to appear)] concerning extrapolation(E) and acceleration(A) of iterative methods for the solution of large-scale least-squares problems. As iterative schemes the SOR and Gauss-Seidel-method (GS) are considered. Explicit expressions for the optimal extrapolation factor of the 3-block EAGS-method are derived. It becomes apparent, that the optimal EAGS converges always faster than the 3-block SOR while strongly competes with the 2-block SOR-method.
0 references
successive overrelaxation
0 references
extrapolation(E)
0 references
acceleration(A)
0 references
iterative methods
0 references
large-scale least-squares problems
0 references
Gauss-Seidel-method
0 references
converges
0 references
0 references
0 references
0 references