J': A New Triangulation of R^n

DOI10.1137/0605026MaRDI QIDQ3330396zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• 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
• Permutation congruent transformations of the freudenthal triangulation with minimum surface density
• scientific article; zbMATH DE number 4193076
• On computation of triangulation with piecewise linearity and separability

Cites work

• scientific article; zbMATH DE number 3780480 (Why is no real title available?)
• scientific article; zbMATH DE number 3487169 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• A Modified Integer Labeling for Complementarity Algorithms
• A class of simplicial restart fixed point algorithms without an extra dimension
• A triangulation of the n-cube
• An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
• An improvement of fixed point algorithms by using a good triangulation
• Equivalence of Surface Density and Average Directional Density
• On triangulations for computing fixed points
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• Tetrahedral Finite Elements for Interpolation
• The computation of fixed points and applications
• The octahedral algorithm, a new simplicial fixed point algorithm
• Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths

Cited in

(8)

• \(D_{RS}\)-triangulation based on \(2^N\)-ray algorithm
• A new triangulation of \(R^n\)
• On computation of triangulation with piecewise linearity and separability
• Equivalence of Surface Density and Average Directional Density
• Permutation congruent transformations of the freudenthal triangulation with minimum surface density
• ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems
• Average Intersection and Pivoting Densities
• Improvement of fixed point algorithms from a triangulation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330396)