On the existence and approximation of zeroes
From MaRDI portal
Publication:3319694
Recommendations
Cites work
- A class of simplicial restart fixed point algorithms without an extra dimension
- A constructive proof of Tucker's combinatorial lemma
- A Modified Integer Labeling for Complementarity Algorithms
- A restart algorithm for computing fixed points without an extra dimension
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- Drei Sätze über die n-dimensionale euklidische Sphäre
- scientific article; zbMATH DE number 3700117 (Why is no real title available?)
- scientific article; zbMATH DE number 3721989 (Why is no real title available?)
- scientific article; zbMATH DE number 3728015 (Why is no real title available?)
- scientific article; zbMATH DE number 3728016 (Why is no real title available?)
- scientific article; zbMATH DE number 3438078 (Why is no real title available?)
- scientific article; zbMATH DE number 3063670 (Why is no real title available?)
- scientific article; zbMATH DE number 3102257 (Why is no real title available?)
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- The computation of fixed points and applications
Cited in
(9)- Approximation of \(\lfloor na+s \rfloor\) and the zero of \(\{ na+s \}\)
- Solving discrete zero point problems
- A variable dimension fixed point algorithm and the orientation of simplices
- On Oka's extra-zero problem and examples
- scientific article; zbMATH DE number 1214042 (Why is no real title available?)
- A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems
- Solving discrete systems of nonlinear equations
- Extended antipodal theorems
- Combinatorial integer labeling theorems on finite sets with applications
This page was built for publication: On the existence and approximation of zeroes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3319694)