Adaptive Order Enrichment with Load Balancing

A 32x32-element mesh with an initial piecewise constant (p = 0) approximation is enriched with piecewise linear ((p = 1), quadratic (p = 2), and cubic (p = 3) elements along a front. An element's color indicates its polynomial degree; red = 0, green = 1, blue = 2, magenta = 3. The resulting mesh is divided evenly among 16 processors, with subdomain boundaries indicated in white. In the decomposition, each element is weighted by its work load (proportional to its polynomial degree). Thus, processors owning high-order elements have far fewer elements than processors owning only low-order elements.




Last Updated: October 15, 1997
WWW Administration (www-admin@www.cs.sandia.gov)
Karen Devine (kddevin@cs.sandia.gov)


Back