A 3D refinement/derefinement algorithm for solving evolution problems

DOI10.1016/S0168-9274(99)00060-4MaRDI QIDQ1975664zbMATH OpenOpenAlexFDO

Authors Miguel A. Padrón, Ángel Plaza, Graham F. Carey

Publication date 27 April 2000

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0168-9274(99)00060-4

zbMATH Keywords

bisectionevolution problemsnumerical examplerefinement/derefinement algorithm

Mathematics Subject Classification ID

Initial value problems for second-order parabolic equations (35K15) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)

Review text

A novel three-dimensional refinement/derefinement algorithm for nested tetrahedral grids based on bisection is given. A simulation test case is also presented.

Cited in

(10)

• On the adjacencies of triangular meshes based on skeleton-regular partitions
• Average adjacencies for tetrahedral skeleton-regular partitions
• Adaptive techniques for unstructured nested meshes
• Refinement based on longest-edge and self-similar four-triangle partitions
• On numerical regularity of trisection-based algorithms in 3D
• Natural hierarchical refinement for finite element methods
• The limit property for the interior solid angles of some refinement schemes for simplicial meshes
• Non-equivalent partitions of \(d\)-triangles with Steiner points
• Adaptive meshing in a mixed regime hydrologic simulation model
• Fast intersections on nested tetrahedrons (FINT): An algorithm for adaptive finite element based distributed parameter estimation

This page was built for publication: A 3D refinement/derefinement algorithm for solving evolution problems

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