$J'$: A New Triangulation of $R^n $

DOI10.1137/0605026zbMath0542.65027OpenAlexW2078561515MaRDI QIDQ3330396

Michael J. Todd

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605026

zbMATH Keywords

numerical examplesFreudenthal triangulationpiecewise linear homotopy algorithmspivoting proceduresTucker triangulation

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Triangulating manifolds (57Q15)

Related Items (1)

‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A triangulation of the n-cube
• The computation of fixed points and applications
• Equivalence of Surface Density and Average Directional Density
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• An improvement of fixed point algorithms by using a good triangulation
• Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths
• A class of simplicial restart fixed point algorithms without an extra dimension
• The octahedral algorithm, a new simplicial fixed point algorithm
• Tetrahedral Finite Elements for Interpolation
• An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
• A Modified Integer Labeling for Complementarity Algorithms
• On triangulations for computing fixed points

This page was built for publication: $J'$: A New Triangulation of $R^n $