Algorithms and data structures for 2D and 3D adaptive finite element mesh refinement
From MaRDI portal
An algorithm for the computation of two- and three-dimensional adaptive mesh refinement is introduced. The performance analysis shows that the method is indeed flexible and efficient. As numerical example, the authors analyze in a \(L\)-shaped domain a linear elliptic boundary value problem from electrostatics.
Recommendations
Cited in
(24)- A dynamic data structure suitable for adaptive mesh refinement in finite element method
- An algorithm for adaptive mesh refinement in \(n\) dimensions
- Adaptive refinement of unstructured finite-element meshes
- Conforming to interface structured adaptive mesh refinement: 3D algorithm and implementation
- Data structures and concepts for adaptive finite element methods
- Adaptive mesh refinement in 2D -- an efficient implementation in \textsc{Matlab}
- Parallel adaptive mesh refinement for incompressible flow problems
- A node reconnection algorithm for mimetic finite difference discretizations of elliptic equations on triangular meshes
- Efficient data structures for adaptive remeshing with the FEM
- Error estimates and adaptive finite element methods. A bibliography (1990--2000)
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Projection and iteration in adaptive finite element refinement
- Adaptive mesh refinement/redistribution for the equations of linear elasticity, boundary element formulation
- 3D adaptive mesh refinement
- scientific article; zbMATH DE number 1268124 (Why is no real title available?)
- ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRID FINITE ELEMENT ANALYSIS
- Derived data structure algorithms for unstructured finite element meshes
- ‘A POSTERIORI’ ERROR INDICATOR AND ERROR ESTIMATORS FOR ADAPTIVE MESH REFINEMENT
- scientific article; zbMATH DE number 1405501 (Why is no real title available?)
- Adaptive dimension splitting algorithm for three-dimensional elliptic equations
- Dynamic adaptive and fully unstructured tetrahedral gridding: application to \(\mathrm{CO}_2\) sequestration with consideration of full fluid compressibility
- An adaptive mesh-refining algorithm allowing for an H^1 stable L^2 projection onto Courant finite element spaces
- A mesh adaptivity scheme on the Landau-de Gennes functional minimization case in 3D, and its driving efficiency
- A collection of 2D elliptic problems for testing adaptive grid refinement algorithms
This page was built for publication: Algorithms and data structures for 2D and 3D adaptive finite element mesh refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345977)