A recursive algorithm for the infinity-norm fixed point problem

DOI10.1016/j.jco.2003.06.001zbMath1090.65159MaRDI QIDQ1887114

Spencer D. Shellman, Krzysztof Sikorski

Publication date: 23 November 2004

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2003.06.001

zbMATH Keywords

Computational complexity; Fixed point; Lipschitz functional; Bisection algorithm

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

47J25: Iterative procedures involving nonlinear operators

47H10: Fixed-point theorems

65Y20: Complexity and performance of numerical algorithms

Related Items

Existence and computation of short-run equilibria in economic geography, A note on two fixed point problems, Circumscribed ellipsoid algorithm for fixed-point problems

Uses Software

• BEDFix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-dimensional bisection envelope algorithm for fixed points
• Attractive cycles in the iteration of meromorphic functions
• Exponential lower bounds for finding Brouwer fixed points
• Optimal solution of nonlinear equations
• Nonlinear differential equations and dynamical systems
• An efficient method for locating and computing periodic orbits of nonlinear mappings
• Approximating fixed points of weakly contracting mappings
• An ellipsoid algorithm for the computation of fixed points
• On the stability of periodic orbits of two-dimensional mappings
• Homotopies for computation of fixed points
• Algorithm 825
• The Approximation of Fixed Points of a Continuous Mapping
• Numerical study of quadratic area-preserving mappings
• Homotopies for computation of fixed points on unbounded regions