An algorithm for adaptive mesh refinement inn dimensions

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1997 English Publisher:Springer Science and Business Media LLCJournal:Computing, volume 59, pages 115-137 (issn: 0010-485X, eissn: 1436-5057,

Copyright policy )

Authors: C. T. Traxler;

doi: 10.1007/bf02684475

An algorithm for adaptive mesh refinement inn dimensions

- Summary
- Subjects
- Metrics

Abstract

This paper deals with local adaptive mesh refinement in \(n\) dimensions in the context of finite element calculations. The given fast algorithm is based on simplex bisection which simplifies bookkeeping of the neighbour graph. A program in C++ is also presented. Notice that bisection refinement leads to certain restrictions on the initial, coarsest grid. The author formulates and proves a criterion for the applicability of the described mesh refinement procedure.

Related Organizations

Justus Liebig University Giessen
Germany

Keywords

mesh generation, finite elements, simplex bisection, mesh refinement, Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	68
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average