An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems

URI	http://purl.tuc.gr/dl/dias/7EA10DA9-15AC-4692-8061-976F8A1D9A9E	-
Identifier	https://doi.org/10.1016/0377-0427(88)90354-8	-
Language	en	-
Extent	16 pages	en
Title	An algorithmic approach for the analysis of extrapolated iterative schemes applied to least-squares problems	en
Creator	Saridakis Ioannis	en
Creator	Σαριδακης Ιωαννης	el
Publisher	Elsevier	en
Content Summary	The problem of determining the optimal values of extrapolated iterative schemes, as they apply to the solution of large-scale least-squares problems, is addressed here. Based on algebraic and geometric eigenvalue properties of the Accelerated Gauss—Seidel (AGS), we devise a simple algorithmic procedure, which successfully yields the optimal values of the Extrapolated AGS (EAGS). Comparisons with the optimal SOR scheme reveal that the two optimal schemes strongly compete. Numerical examples are used to demonstrate our results.	en
Type of Item	Peer-Reviewed Journal Publication	en
Type of Item	Δημοσίευση σε Περιοδικό με Κριτές	el
License	http://creativecommons.org/licenses/by/4.0/	en
Date of Item	2015-10-16	-
Date of Publication	1988	-
Subject	Greek mathematics	en
Subject	mathematics greek	en
Subject	greek mathematics	en
Bibliographic Citation	Y. G. Saridakis, “An algorithmic approach for the analysis of extrapolated iterative schemes applied to least – squares problems,” J. of Comp. Appl. ,vol.21,no.1-2, pp. 209-225, Math.,1988. doi:10.1016/0377-0427(88)90354-8	en

Export

Metadata & Content in a METS Package:

Metadata in Format: