On the existence and approximation of zeroes

DOI10.1007/BF02612710zbMath0535.65031MaRDI QIDQ3319694

Gerard van der Laan

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

Brouwer degreecomplementary pivotingsimplicial approximationvariable dimension algorithmcomplementary 1-simplexconvex, compact subset

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10)

Related Items (5)

Solving discrete systems of nonlinear equations ⋮ Combinatorial integer labeling theorems on finite sets with applications ⋮ Solving discrete zero point problems ⋮ Extended antipodal theorems ⋮ A variable dimension fixed point algorithm and the orientation of simplices

Cites Work

• A constructive proof of Tucker's combinatorial lemma
• 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 variable-dimension simplicial algorithm for antipodal fixed-point theorems
• A Modified Integer Labeling for Complementarity Algorithms
• A restart algorithm for computing fixed points without an extra dimension
• Drei Sätze über die n-dimensionale euklidische Sphäre
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the existence and approximation of zeroes