A collection of 2D elliptic problems for testing adaptive grid refinement algorithms

摘要

Adaptive grid refinement is a critical component of the improvements that have recently been made in algorithms for the numerical solution of partial differential equations (PDEs). The development of new algorithms and computer codes for the solution of PDEs usually involves the use of proof-of-concept test problems. 2D elliptic problems are often used as the first test bed for new algorithms and codes. This paper contains a set of twelve parametrized 2D elliptic test problems for adaptive grid refinement algorithms and codes. The problems exhibit a variety of types of singularities, near singularities, and other difficulties.