J': A New Triangulation of R^n

DOI10.1137/0605026zbMATH Open0542.65027OpenAlexW2078561515MaRDI QIDQ3330396FDOQ3330396

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

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

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)

Cites Work

• Title not available (Why is that?)
• The computation of fixed points and applications
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• A class of simplicial restart fixed point algorithms without an extra dimension
• A triangulation of the n-cube
• A Modified Integer Labeling for Complementarity Algorithms
• Equivalence of Surface Density and Average Directional Density
• On triangulations for computing fixed points
• The octahedral algorithm, a new simplicial fixed point algorithm
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Tetrahedral Finite Elements for Interpolation
• Traversing Large Pieces of Linearity in Algorithms that Solve Equations by Following Piecewise-Linear Paths

Cited In (8)

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

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)