Abstract
Ordinary iteration schemes for solving linear algebraic equations are one-step, i.e., only the last iterant is used in order to compute the following one. This note advocates the use of several iterants by means of least-square acceleration. The resulting scheme is easy to implement and is very effective in cases where the basic iteration matrix is close to symmetric. The note provides theoretical estimates for the rate of convergence as well as a numerical example. The example deals with the numerical solution of Poisson's equation in a rectangular annulus, by five-point formulae, using the alternating-direction method.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Varga, R. S.,Matrix Iterative Analysis, Prentice Hall, Englewood Cliffs, New Jersey, 1962.
Kaniel, S.,Estimates for Some Computational Techniques in Linear Algebra, Mathematics of Computation, Vol. 20, pp. 369–378, 1966.
Author information
Authors and Affiliations
Additional information
Communicated by A. V. Balakrishnan
Rights and permissions
About this article
Cite this article
Kaniel, S., Stein, J. Least-square acceleration of iterative methods for linear equations. J Optim Theory Appl 14, 431–437 (1974). https://doi.org/10.1007/BF00933309
Issue Date:
DOI: https://doi.org/10.1007/BF00933309