On the observed rate of convergence of an iterative method applied to a model elliptic difference equation
HTML articles powered by AMS MathViewer
- by R. A. Nicolaides PDF
- Math. Comp. 32 (1978), 127-133 Request permission
Abstract:
A proof is given of the fact that the rate of convergence of a multiple grid type of algorithm is $O({h^{1/2}})$ in the case of a model elliptic difference equation.References
- Gene H. Golub and Richard S. Varga, Chebyshev semi-iterative methods, successive over-relaxation iterative methods, and second order Richardson iterative methods. I, Numer. Math. 3 (1961), 147–156. MR 145678, DOI 10.1007/BF01386013
- R. A. Nicolaides, On multiple grid and related techniques for solving discrete elliptic systems, J. Comput. Phys. 19 (1975), no. 4, 418–431. MR 413541, DOI 10.1016/0021-9991(75)90072-8
- Richard S. Varga, Matrix iterative analysis, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1962. MR 0158502
- David M. Young, Iterative solution of large linear systems, Academic Press, New York-London, 1971. MR 0305568
Additional Information
- © Copyright 1978 American Mathematical Society
- Journal: Math. Comp. 32 (1978), 127-133
- MSC: Primary 65N10
- DOI: https://doi.org/10.1090/S0025-5718-1978-0458932-0
- MathSciNet review: 0458932