Permutation congruent transformations of the freudenthal triangulation with minimum surface density
From MaRDI portal
Publication:3694571
DOI10.1007/BF02591731zbMath0575.65061MaRDI QIDQ3694571
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
path following; Freudenthal triangulation; simplicial homotopy methods; surface density; directional density; permutation congruent triangulation; PL homotopies; Simplicial triangulations
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65H10: Numerical computation of solutions to systems of equations
51M20: Polyhedra and polytopes; regular figures, division of spaces
Related Items
Cites Work
- Simplizialzerlegungen von beschränkter Flachheit
- Equivalence of Surface Density and Average Directional Density
- An improvement of fixed point algorithms by using a good triangulation
- The octahedral algorithm, a new simplicial fixed point algorithm
- On triangulations for computing fixed points
- Efficient Acceleration Techniques for Fixed Point Algorithms
- Improving the convergence of fixed-point algorithms
- A restart algorithm for computing fixed points without an extra dimension
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Homotopies for computation of fixed points on unbounded regions