A better triangulation for Wright's \(2^n\)-ray algorithm
From MaRDI portal
Publication:1365094
DOI10.1006/jmaa.1997.5514zbMath0933.65056OpenAlexW1984688851MaRDI QIDQ1365094
Chuangyin Dang, Adolphus J. J. 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
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A course in triangulations for solving equations with deformations
- A simple and relatively efficient triangulation of the n-cube
- A triangulation of the n-cube
- Extensions of Lemke's algorithm for the linear complementarity problem
- Simplicial algorithms on the simplotope
- Simplizialzerlegungen von beschränkter Flachheit
- A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- The Middle-Cut Triangulations of the n-Cube
- Equivalence of Surface Density and Average Directional Density
- The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
- A Simplicial Algorithm for Stationary Point Problems on Polytopes
- 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
- The octahedral algorithm, a new simplicial fixed point algorithm
- A new variable dimension algorithm for the fixed point problem
- On triangulations for computing fixed points
- Improving the convergence of fixed-point algorithms
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- A New Triangulation for Simplicial Algorithms
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
- Homotopies for computation of fixed points on unbounded regions
This page was built for publication: A better triangulation for Wright's \(2^n\)-ray algorithm
