Algorithms for refining triangular grids suitable for adaptive and multigrid techniques. (English) Zbl 0536.65085

Bisection of triangles by the longest side is used for refining triangulations locally or globally. Two algorithms are presented which generate a new, refined conforming triangulation. The shape regularity is maintained and the transition between small and large triangles is smooth in a natural way. The algorithms are fairly simple and their properties are proved. They can be used for generating nested triangulations and adaptive local refinements suitable for multigrid methods.
Reviewer: J.Mandel


65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
65N22 Numerical solution of discretized equations for boundary value problems involving PDEs
65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
Full Text: DOI


[1] Rosenberg, Math. Comp. 29 pp 390– (1975)
[2] Stynes, Math. Comp. 35 pp 1195– (1980)
[3] Thacker, Int. j. numer. methods eng. 15 pp 1335– (1980)
[4] Bank, Math. Comp. 36 pp 35– (1981)
[5] Nicolaides, Math. Comp. 31 pp 892– (1977)
[6] Nicolaides, Math. Comp. 33 pp 933– (1979)
[7] and , ’Computational aspects of the finite element method’, in Mathematical Software, (Ed.), Academic Press, New York, 1977, pp. 225-255.
[8] Babuska, SIAM J. Numer. Anal. 15 pp 736– (1978)
[9] and , ’The use of adaptive grid refinement for badly behaved elliptic partial differential equations’, in Advances in Computer Methods for Partial Differential Equations ( and , eds.), vol. III, I.M.A.C.S., 1979, pp. 33-39.
[10] Bank, Computing 26 pp 91– (1981)
[11] Rheinboldt, Int. j. numer. methods eng. 17 pp 649– (1981)
[12] Rheinboldt, A.C.M. Trans. Math. Software 6 pp 166– (1980)
[13] Zave, A.C.M. Trans. Math. Software 5 pp 1– (1979)
[14] ’Design of a fully adaptive multigrid finite element software’, K. U. Leuven, Department of Computer Science (1982).
[15] Kearfott, Math. Comp. 32 pp 1147– (1978)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.