Permutation congruent transformations of the freudenthal triangulation with minimum surface density
DOI10.1007/BF02591731zbMATH Open0575.65061MaRDI QIDQ3694571FDOQ3694571
Authors: B. Curtis Eaves 
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
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
path followingFreudenthal triangulationsimplicial homotopy methodssurface densitydirectional densitypermutation congruent triangulationPL homotopiesSimplicial triangulations
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Cites Work
- A restart algorithm for computing fixed points without an extra dimension
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Efficient Acceleration Techniques for Fixed Point Algorithms
- Homotopies for computation of fixed points on unbounded regions
- Simplizialzerlegungen von beschränkter Flachheit
- Equivalence of Surface Density and Average Directional Density
- On triangulations for computing fixed points
- The octahedral algorithm, a new simplicial fixed point algorithm
- Improving the convergence of fixed-point algorithms
- An improvement of fixed point algorithms by using a good triangulation
Cited In (4)
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)
