Abstract
The structure of Multi-Level Adaptive Algorithms is explained. Their recursive character is exposed by means of the formal language ALGOL 68. The basic structure is given in two forms: coarse grid corrections to fine grids and fine grid corrections to coarse grids. The latter description can be used for the treatment of fully automatic adaptive grids. A new description of the FAS FMG algorithm of Brandt is given and the last section concludes with an ALGOL 68 procedure for the solution of boundary value problems with adaptive mesh-refinement.
Similar content being viewed by others
References
A. Brandt,Multi-level adaptive solutions to boundary value problems, Math. Comp. 31 (1977), 333–390.
A. Brandt,Multi-Level Adaptive Solutions to Partial Differential Equations — Ideas and Software, Proceedings of Symposium on Mathematical Software. (Mathematics Research Center, University of Wisconsin, March 1977), (John Rice, ed.) pp. 277–318, Academic Press, New York.
A. Brandt,Multi-Level Adaptive Techniques (MLAT) for Singular Perturbation Problems. (In: Numerical Analysis of Singular Perturbation Problems, P. W. Hemker and J. J. H. Miller eds., Academic Press, London, 1979.)
R. A. Nicolaides,On the observed rate of convergence of an iterative method applied to a model elliptic difference equation, Math. Comp. 32 (1978), 127–133.
H. J. Stetter,The defect correction principle and discretization methods, Num. Math. 29 (1978), 425–443.
Van Wijngaarden et al. Eds.,Revised Report on the Algorithmic Language ALGOL 68, Springer-Verlag, New York, Heidelberg, Berlin (1976).
P. Wesseling,A convergence proof for a multiple grid method, Report NA-21 (1978), Delft Technical University, The Netherlands.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hemker, P.W. On the structure of an adaptive multi-level algorithm. BIT 20, 289–301 (1980). https://doi.org/10.1007/BF01932771
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932771