A comparison of adaptive refinement techniques for elliptic problems

Adaptive refinement has proved to be a useful tool for reducing the size of the linear system of equations obtained by discretizing partial differential equations. We consider techniques for the adaptive refinement of triangulations used with the finite element method with piecewise linear functions. Several such techniques that differ mainly in the method for dividing triangles and the method for indicating which triangles have the largest error have been developed. We describe four methods for dividing triangles and eight methods for indicating errors. Angle bounds for the triangle division methods are compared. All combinations of triangle divisions and error indicators are compared in a numerical experiment using a population of eight test problems with a variety of difficulties (peaks, boundary layers, singularities, etc.). The comparison is based on the L-infinity norm of the error versus the number of vertices. It is found that all of the methods produce asymptotically optimal grids and that the number of vertices needed for a given error rarely differs by more than a factor of two.

[1]  John R. Rice,et al.  A Population of Linear, Second Order, Elliptic Partial Differential Equations on Rectangular Domains. Part 1 , 1981 .

[2]  Ivo Babuška,et al.  A posteriori error analysis and adaptive processes in the finite element method: Part I—error analysis , 1983 .

[3]  I. Fried Condition of finite element matrices generated from nonuniform meshes. , 1972 .

[4]  W. Rheinboldt,et al.  Error Estimates for Adaptive Finite Element Computations , 1978 .

[5]  M. Rivara Mesh Refinement Processes Based on the Generalized Bisection of Simplices , 1984 .

[6]  Randolph E. Bank,et al.  The use of adaptive grid refinement for badly behaved elliptic partial differential equations , 1980 .

[7]  R. Bank,et al.  Some a posteriori error estimators for elliptic partial differential equations , 1985 .

[8]  Granville Sewell,et al.  Analysis of a finite element method--PDE/PROTRAN , 1985 .

[9]  I. Babuska,et al.  ON THE ANGLE CONDITION IN THE FINITE ELEMENT METHOD , 1976 .

[10]  María Cecilia Rivara,et al.  Design and data structure of fully adaptive, multigrid, finite-element software , 1984, ACM Trans. Math. Softw..

[11]  F. Stenger,et al.  A lower bound on the angles of triangles constructed by bisecting the longest side , 1975 .

[12]  F MitchellWilliam A comparison of adaptive refinement techniques for elliptic problems , 1989 .

[13]  E. G. Sewell,et al.  Automatic generation of triangulations for piecewise polynomial approximation , 1972 .

[14]  I. Babuska,et al.  Hierarchical Finite Element Approaches Error Estimates and Adaptive Refinement , 1981 .

[15]  Ivo Babuška,et al.  A posteriori error analysis and adaptive processes in the finite element method: Part II—adaptive mesh refinement , 1983 .

[16]  M. Rivara Algorithms for refining triangular grids suitable for adaptive and multigrid techniques , 1984 .