Approximating fixed points of weakly contracting mappings
From MaRDI portal
Publication:1974567
DOI10.1006/jcom.1999.0504zbMath0948.65055OpenAlexW1972041507MaRDI QIDQ1974567
Publication date: 7 May 2000
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1999.0504
Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20)
Related Items
A recursive algorithm for the infinity-norm fixed point problem ⋮ Existence and computation of short-run equilibria in economic geography ⋮ Application of Canonical Duality Theory to Fixed Point Problem ⋮ Unique end of potential line ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ 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 ⋮ A two-dimensional bisection envelope algorithm for fixed points ⋮ Unique End of Potential Line
Cites Work
- Optimal solution of nonlinear equations
- Complexity of fixed points. I
- On optimality of Krylov's information when solving linear operator equations
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- An ellipsoid algorithm for the computation of fixed points
- Linear Matrix Inequalities in System and Control Theory
- Random walks and anO*(n5) volume algorithm for convex bodies
- The Approximation of Fixed Points of a Continuous Mapping
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item