A two-dimensional bisection envelope algorithm for fixed points

DOI10.1006/jcom.2001.0625zbMath1035.65053OpenAlexW2743986995MaRDI QIDQ700187

Krzysztof Sikorski, Spencer D. Shellman

Publication date: 30 September 2002

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

Full work available at URL: https://semanticscholar.org/paper/577d4703b8e5f981226da1aea67c689bcfda0100

zbMATH Keywords

infinity normfixed point problemLipschitz continuous functionfixed points approximationstwo-dimensional bisection envelope algorithm

Mathematics Subject Classification ID

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

Related Items (5)

A recursive algorithm for the infinity-norm fixed point problem ⋮ Application of Canonical Duality Theory to Fixed Point Problem ⋮ A note on two fixed point problems ⋮ Circumscribed ellipsoid algorithm for fixed-point problems ⋮ On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Exponential lower bounds for finding Brouwer fixed points
• Optimal solution of nonlinear equations
• Approximating fixed points of weakly contracting mappings
• An ellipsoid algorithm for the computation of fixed points
• Homotopies for computation of fixed points
• The Approximation of Fixed Points of a Continuous Mapping
• Homotopies for computation of fixed points on unbounded regions

This page was built for publication: A two-dimensional bisection envelope algorithm for fixed points