Abstract

In this talk, we will discuss a new mesh adaptivity algorithm for elliptic PDEs that combines a posteriori error estimation with centroidal Voronoi/Delaunay tessellations of domains in two dimensions. The ability of the first ingredient to detect local regions of large error and the ability of the second ingredient to generate superior unstructured grids result in an mesh adaptivity algorithm that has several very desirable features, including the following. Errors are very well equidistributed over the triangles; at all levels of refinement, the triangles remain very well shaped, even if the grid size at any particular refinement level, when viewed globally, varies by several orders of magnitude; and the convergence rates achieved are the best obtainable using piecewise linear finite elements.

TUESDAY, February 14, 2005
Time: 1:30 P.M.
Location: PPB 300