Longest-edge \(n\)-section algorithms: properties and open problems
From MaRDI portal
Publication:747921
DOI10.1016/j.cam.2015.03.046zbMath1329.65292OpenAlexW1022683958MaRDI QIDQ747921
Sergey Korotov, José P. Suárez, Ángel Plaza
Publication date: 19 October 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.03.046
finite element methodmesh refinementmesh regularitysimplicial partitionangle conditionslongest-edge \(n\)-section algorithm
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Complexity and performance of numerical algorithms (65Y20) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (4)
On degenerating finite element tetrahedral partitions ⋮ Improved Maximum Angle Estimate for Longest-Edge Bisection ⋮ On Numerical Regularity of Trisection-Based Algorithms in 3D ⋮ On Regularity of Tetrahedral Meshes Produced by Some Red-Type Refinements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-sided estimation of diameters reduction rate for the longest edge \(n\)-section of triangles with \(n\geqslant 4\)
- Properties of triangulations obtained by the longest-edge bisection
- The limit property for the interior solid angles of some refinement schemes for simplicial meshes
- Generalization of the Zlamal condition for simplicial finite elements in \(\mathbb {R}^{d}\)
- Properties of the longest-edge \(n\)-section refinement scheme for triangular meshes
- On semiregular families of triangulations and linear interpolation
- Proving the non-degeneracy of the longest-edge trisection by a space of triangular shapes with hyperbolic metric
- On the equivalence of regularity criteria for triangular and tetrahedral finite element partitions
- On the non-degeneracy property of the longest-edge trisection of triangles
- Lepp-bisection algorithms, applications and mathematical properties
- On the equivalence of ball conditions for simplicial finite elements in \(\mathbf R^d\)
- Sard kernel theorems on triangular domains with application to finite element error bounds
- On the maximum angle condition for the conforming longest-edge \(n\)-section algorithm for large values of \(n\)
- A recursive approach to local mesh refinement in two and three dimensions
- Tetrahedral grid refinement
- On global and local mesh refinements by a generalized conforming bisection algorithm
- Local refinement of simplicial grids based on the skeleton
- A mathematical proof of how fast the diameters of a triangle mesh tend to zero after repeated trisection
- A new proof of the degeneracy property of the longest-edge \(n\)-section refinement scheme for triangular meshes
- Refinement based on longest-edge and self-similar four-triangle partitions
- Mesh quality improvement and other properties in the four-triangles longest-edge partition
- Four-triangles adaptive algorithms for RTIN terrain meshes
- On the finite element method
- Non-degeneracy study of the 8-tetrahedra longest-edge partition
- Graph-based data structures for skeleton-based refinement algorithms
- On a Bisection Algorithm That Produces Conforming Locally Refined Simplicial Meshes
- On generalized bisection of 𝑛-simplices
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- A bisection method for systems of nonlinear equations
- Selective refinement/derefinement algorithms for sequences of nested triangulations
- Propagation of longest-edge mesh patterns in local adaptive refinement
- On the Bisection Method for Triangles
- On Faster Convergence of the Bisection Method for all Triangles
- An equilibrium finite element method in three-dimensional elasticity
- Local mesh refinement in 2 and 3 dimensions
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- On the Angle Condition in the Finite Element Method
- Optimal Dissection of Simplices
- A Proof of Convergence and an Error Bound for the Method of Bisection in R n
- On Faster Convergence of the Bisection Method for Certain Triangles
- A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
- On the Shape of Tetrahedra from Bisection
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Locally Adapted Tetrahedral Meshes Using Bisection
- The 4-triangles longest-side partition of triangles and linear refinement algorithms
- Quality Local Refinement of Tetrahedral Meshes Based on Bisection
- Simple algorithm for adaptive refinement of three-dimensional finite element tetrahedral meshes
- The completion of locally refined simplicial partitions created by bisection
This page was built for publication: Longest-edge \(n\)-section algorithms: properties and open problems
