A better triangulation for Wright's 2ⁿ-ray algorithm

DOI10.1006/JMAA.1997.5514MaRDI QIDQ1365094zbMATH OpenOpenAlexFDO

Authors Chuangyin Dang, Dolf Talman

Publication date 20 March 2000

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jmaa.1997.5514

zbMATH Keywords

\( 2^{n}\)-ray algorithmsimplicial fixed point algorithmtriangulations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Review text

It is well-known that the efficiency of simplicial fixed point algorithms crucially depends on the underlying triangulations. In this paper, the authors propose a modification of \textit{A. H. Wright}'s \(2^{n}\)-ray algorithm [Math. Program. 21, 47-69 (1981; Zbl 0475.65029)]. It is shown that this modification is better than any other available triangulation for the \(2^{n}\)-ray algorithm.

Recommendations

• \(D_{RS}\)-triangulation based on \(2^N\)-ray algorithm
• A New Triangulation for Simplicial Algorithms
• Improvement of fixed point algorithms from a triangulation
• scientific article; zbMATH DE number 4073956
• J': A New Triangulation of R^n

Cites work

• A class of simplicial restart fixed point algorithms without an extra dimension
• A course in triangulations for solving equations with deformations
• A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
• A New Triangulation for Simplicial Algorithms
• A new variable dimension algorithm for the fixed point problem
• A restart algorithm for computing fixed points without an extra dimension
• A simple and relatively efficient triangulation of the n-cube
• A Simplicial Algorithm for Stationary Point Problems on Polytopes
• A triangulation of the n-cube
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
• Equivalence of Surface Density and Average Directional Density
• Extensions of Lemke's algorithm for the linear complementarity problem
• Homotopies for computation of fixed points
• Homotopies for computation of fixed points on unbounded regions
• scientific article; zbMATH DE number 3898791 (Why is no real title available?)
• scientific article; zbMATH DE number 3669736 (Why is no real title available?)
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• Improving the convergence of fixed-point algorithms
• On triangulations for computing fixed points
• Simplicial algorithms on the simplotope
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• SIMPLICIAL APPROXIMATION OF FIXED POINTS
• Simplizialzerlegungen von beschränkter Flachheit
• The Approximation of Fixed Points of a Continuous Mapping
• The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
• The Middle-Cut Triangulations of the n-Cube
• The octahedral algorithm, a new simplicial fixed point algorithm

Cited in

(2)

• \(D_{RS}\)-triangulation based on \(2^N\)-ray algorithm
• Improvement of fixed point algorithms from a triangulation

This page was built for publication: A better triangulation for Wright's \(2^n\)-ray algorithm

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