Permutation congruent transformations of the freudenthal triangulation with minimum surface density
From MaRDI portal
Recommendations
- J': A New Triangulation of R^n
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
- The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
- Improvement of fixed point algorithms from a triangulation
Cites work
- A restart algorithm for computing fixed points without an extra dimension
- An improvement of fixed point algorithms by using a good triangulation
- Efficient Acceleration Techniques for Fixed Point Algorithms
- Equivalence of Surface Density and Average Directional Density
- Homotopies for computation of fixed points on unbounded regions
- Improving the convergence of fixed-point algorithms
- On triangulations for computing fixed points
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Simplizialzerlegungen von beschränkter Flachheit
- The octahedral algorithm, a new simplicial fixed point algorithm
Cited in
(6)- Simplicial grid refinement: On Freudenthal's algorithm and the optimal number of congruence classes
- J': A New Triangulation of R^n
- Equivalence of Surface Density and Average Directional Density
- ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
- Triangulate flat cones on simplices
- Average Intersection and Pivoting Densities
This page was built for publication: Permutation congruent transformations of the freudenthal triangulation with minimum surface density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694571)