Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
From MaRDI portal
Publication:1972268
DOI10.1007/s002110050475zbMath0949.65128OpenAlexW2079386274MaRDI QIDQ1972268
Publication date: 5 December 2000
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050475
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)
Related Items (40)
EdgeCFD: a parallel residual-based variational multiscale code for multiphysics ⋮ On degenerating tetrahedra resulting from red refinements of tetrahedral partitions ⋮ The optimal refinement strategy for 3-D simplicial meshes ⋮ Mathematically Founded Design of Adaptive Finite Element Software ⋮ Numerical approximation of multi-phase Penrose-Fife systems ⋮ A finite element based level set method for two-phase incompressible flows ⋮ The Auxiliary Space Preconditioner for the de Rham Complex ⋮ New strategy for robust stability analysis of discrete-time uncertain systems ⋮ Adaptive Multilevel Monte Carlo Methods for Stochastic Variational Inequalities ⋮ Properties of the multidimensional finite elements ⋮ Optimistic optimization for continuous nonconvex piecewise affine functions ⋮ Extended finite element method in mixed-hybrid model of singular groundwater flow ⋮ Optimization of Subdivision Invariant Tetrahedra ⋮ On degenerating finite element tetrahedral partitions ⋮ Approximation of the electron density of aluminium clusters in tensor-product format ⋮ Two Conjectures on the Stokes Complex in Three Dimensions on Freudenthal Meshes ⋮ The limit property for the interior solid angles of some refinement schemes for simplicial meshes ⋮ On Regularity of Tetrahedral Meshes Produced by Some Red-Type Refinements ⋮ Stability of the 8-tetrahedra shortest-interior-edge partitioning method ⋮ Refinement strategies related to cubic tetrahedral meshes ⋮ Local Bisection for Conformal Refinement of Unstructured 4D Simplicial Meshes ⋮ Average adjacencies for tetrahedral skeleton-regular partitions ⋮ Ultraconvergence of Finite Element Method by Richardson Extrapolation for Elliptic Problems with Constant Coefficients ⋮ The completion of locally refined simplicial partitions created by bisection ⋮ Red refinements of simplices into congruent subsimplices ⋮ Non-periodic finite-element formulation of Kohn-Sham density functional theory ⋮ Space-time least-squares finite elements for parabolic equations ⋮ Stable subdivision of 4D polytopes ⋮ A Parallel Strategy for a Level Set Simulation of Droplets Moving in a Liquid Medium ⋮ Non-periodic finite-element formulation of orbital-free density functional theory ⋮ Quasi-continuum orbital-free density-functional theory: a route to multi-million atom non-periodic DFT calculation ⋮ Fractal Homogenization of Multiscale Interface Problems ⋮ A Tetrahedral Space-Filling Curve for Nonconforming Adaptive Meshes ⋮ Optimal quasi-diagonal preconditioners for pseudodifferential operators of order minus two ⋮ Some Convergence and Optimality Results of Adaptive Mixed Methods in Finite Element Exterior Calculus ⋮ Parallel adaptive subspace correction schemes with applications to elasticity ⋮ Preserved Structure Constants for Red Refinements of Product Elements ⋮ Numerical homogenization of fractal interface problems ⋮ On the adjacencies of triangular meshes based on skeleton-regular partitions ⋮ On refinement strategies for solving \(\textsc{MINLP}\)s by piecewise linear relaxations: a generalized red refinement
This page was built for publication: Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
