Natural hierarchical refinement for finite element methods
✍ Scribed by Petr Krysl; Eitan Grinspun; Peter Schröder
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 424 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0029-5981
- DOI
- 10.1002/nme.601
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Current formulations of adaptive finite element mesh refinement seem simple enough, but their implementations prove to be a formidable task. We offer an alternative point of departure which yields equivalent adapted approximation spaces wherever the traditional mesh refinement is applicable, but our method proves to be significantly simpler to implement. At the same time it is much more powerful in that it is general (no special tricks are required for different types of finite elements), and applicable for some newer approximations where traditional mesh refinement concepts are not of much help, for instance on subdivision surfaces. Copyright © 2003 John Wiley & Sons, Ltd.
📜 SIMILAR VOLUMES
## Abstract Two efficiency‐based grid refinement strategies are investigated for adaptive finite element solution of partial differential equations. In each refinement step, the elements are ordered in terms of decreasing local error, and the optimal fraction of elements to be refined is determined
## Abstract The inclusion principle provides a qualitative characterization of the eigenvalues of a matrix. The principle has been shown to apply to systems described by a single Hermitian matrix, the most important of which being the real symmetric matrix. Self‐adjoint distributed systems, when di