Adaptive computations on conforming quadtree meshes

Search all papers

Notify me of new papers
via Email or RSS

Adaptive computations on conforming quadtree meshes
A Tabarraei
N Sukumar, University of California, Davis

	Download the Article (4.4 MB, PDF file) - 2005	Tell a colleague about it.
	Printing Tips: Select 'print as image' in the Acrobat print dialog if you have trouble printing.

ABSTRACT:

In this paper, the quadtree data structure and conforming polygonal interpolants are used to develop an h-adaptive finite element method. Quadtree is a hierarchical data structure that is computationally attractive for adaptive numerical simulations. Mesh generation and adaptive refinement of quadtree meshes is straight-forward. However, finite elements are non-conforming on quadtree meshes due to level-mismatches between adjacent elements, which results in the presence of so-called hanging nodes. In this study, we use meshfree (natural-neighbor, nn) basis functions on a reference element combined with an affine map to construct conforming approximations on quadtree meshes. Numerical examples are presented to demonstrate the accuracy and performance of the proposed h-adaptive finite element method. (c) 2005 Elsevier B.V. All rights reserved.

SUGGESTED CITATION:
A Tabarraei and N Sukumar, "Adaptive computations on conforming quadtree meshes" (2005). Finite Elements in Analysis and Design. 41 (7-8), pp. 686-702. Postprint available free at: http://repositories.cdlib.org/postprints/562

REQUIRED PUBLISHER STATEMENT:
The original publication is available in Finite Elements in Analysis and Design.

eScholarship is a service of the California Digital Library