Complexity of fixed points. I

DOI10.1016/0885-064X(87)90008-2MaRDI QIDQ1101185zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computational complexity of fixed points
• scientific article; zbMATH DE number 4205881
• Complexity of fixed point computation
• An ellipsoid algorithm for the computation of fixed points
• Algorithm 848

Cites work

• scientific article; zbMATH DE number 3809326 (Why is no real title available?)
• scientific article; zbMATH DE number 3790207 (Why is no real title available?)
• scientific article; zbMATH DE number 3487169 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• Bisection is optimal
• Extensions of Lemke's algorithm for the linear complementarity problem
• Homotopies for computation of fixed points
• Information of varying cardinality
• On the Optimal Solution of Large Linear Systems
• On the efficiency of algorithms of analysis
• On the optimality of Krylov information
• Optimal solution of nonlinear equations
• Probabilistic setting of information-based complexity
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• The Approximation of Fixed Points of a Continuous Mapping

Cited in

(14)

• Complexity of fixed point computation
• On the complexity of finding a Caristi's fixed point
• The Null Space Problem I. Complexity
• Is There a Curse of Dimensionality for Contraction Fixed Points in the Worst Case?
• Approximating fixed points of weakly contracting mappings
• Spherical algorithms and evaluation of the fixed point set
• Condition-sensitive computation of approximate fixed points
• Exponential lower bounds for finding Brouwer fixed points
• A recursive algorithm for the infinity-norm fixed point problem
• Circumscribed ellipsoid algorithm for fixed-point problems
• Computational complexity of fixed points
• The complexity of Tarski's fixed point theorem
• A note on two fixed point problems
• Search for the fixed point of a discrete monotonically decreasing operator

This page was built for publication: Complexity of fixed points. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1101185)