Complexity of fixed points. I

DOI10.1016/0885-064X(87)90008-2zbMath0642.65032OpenAlexW2039122385MaRDI QIDQ1101185

B. George

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0885-064x(87)90008-2

zbMATH Keywords

complexityrelative error criterioncontractive functionfixed point envelope algorithmsimple iteration algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05)

Related Items

Exponential lower bounds for finding Brouwer fixed points, Approximating fixed points of weakly contracting mappings, A note on two fixed point problems, Circumscribed ellipsoid algorithm for fixed-point problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the optimality of Krylov information
• Optimal solution of nonlinear equations
• Probabilistic setting of information-based complexity
• Bisection is optimal
• Extensions of Lemke's algorithm for the linear complementarity problem
• Information of varying cardinality
• On the efficiency of algorithms of analysis
• On the Optimal Solution of Large Linear Systems
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• Homotopies for computation of fixed points
• The Approximation of Fixed Points of a Continuous Mapping