On a Data Structure for Adaptive Finite Element Mesh Refinements

DOI10.1145/355887.355891MaRDI QIDQ3878699zbMATH OpenOpenAlexWikidataFDO

Authors Charles Mesztenyi, Werner C. Rheinboldt

Publication date 1980

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355887.355891

zbMATH Keywords

data structureelemental stiffness matricesfundamental access algorithmslabeled tree structuremesh refinementsnested dissection techniquesnonuniform two- dimensional finite-element meshes

Mathematics Subject Classification ID

Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Algorithms in computer science (68W99) Finite element methods applied to problems in solid mechanics (74S05)

Cited in

(31)

• Efficient adaptive procedures for fluid-flow applications
• Automatic mesh generation allowing for efficient a priori and a posteriori mesh refinement
• A preconditioning technique for the efficient solution of problems with local grid refinement
• Development of a hierarchical and adaptive finite element software
• Approximating the minimum weight Steiner triangulation
• Solving partial differential equations using recursive grids
• On open and closed tips of Bunsen burner flames
• An h-type adaptive finite element
• Application of hp-adaptive BE/FE methods to elastic scattering
• Parallel adaptive subspace correction schemes with applications to elasticity
• A goal-oriented error estimator for a class of homogenization problems
• Spatial adaptivity of the SAAF and weighted least squares (WLS) forms of the neutron transport equation using constraint based, locally refined, isogeometric analysis (IGA) with dual weighted residual (DWR) error measures
• A generic interface for parallel cell-based finite element operator application
• Object-oriented programming of adaptive finite element and finite volume methods
• A tetrahedral space-filling curve for nonconforming adaptive meshes
• Recursive algorithms for distributed forests of octrees
• Mesh enrichment against mesh regeneration using quadrilateral elements
• Design and data structure of fully adaptive, multigrid, finite-element software
• ALGORITHMIC ASPECTS OF ADAPTIVE MULTIGRID FINITE ELEMENT ANALYSIS
• Coarse mesh partitioning for tree-based AMR
• On hanging node constraints for nonconforming finite elements using the Douglas-Santos-Sheen-Ye element as an example
• The aggregated unfitted finite element method on parallel tree-based adaptive meshes
• A Generic Finite Element Framework on Parallel Tree-Based Adaptive Meshes
• Dynamic adaptive and fully unstructured tetrahedral gridding: application to \(\mathrm{CO}_2\) sequestration with consideration of full fluid compressibility
• Adaptive techniques for time-dependent problems
• Quasi-optimal mesh generation for the virtual element method: a fully adaptive remeshing procedure
• Toward a universal h-p adaptive finite element strategy. I: Constrained approximation and data structure
• Computational error estimates and adaptive processes for some nonlinear structural problems
• Algorithms and data structures for adaptive multigrid elliptic solvers
• Finite element methods for nonlinear flows in porous media
• A posteriori error estimation

This page was built for publication: On a Data Structure for Adaptive Finite Element Mesh Refinements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3878699)