Bounded flatness in \(Q\)-triangulated regular \(n\)-simplexes

DOI10.1016/S0096-3003(96)00310-4zbMath0914.65057MaRDI QIDQ1126674

Chung-Kuang Chu, Edmond A. Jonckheere

Publication date: 2 August 1998

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

simplicial algorithmsbounded flatness of simplexesiterative \(Q\)-refinement

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items

On the non-degeneracy property of the longest-edge trisection of triangles, Simplicial algorithms for computing stationary probabilities of stochastic matrices

Uses Software

• SimplicialVIEW

Cites Work

• Developments and trends in three-dimensional mesh generation
• Provably good mesh generation
• Triangulations and simplicial methods
• Simplicial algorithms on the simplotope
• Tetrahedral grid refinement
• Simplizialzerlegungen von beschränkter Flachheit
• On the Shape of Tetrahedra from Bisection
• Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
• The Approximation of Fixed Points of a Continuous Mapping
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item