Circumscribed ellipsoid algorithm for fixed-point problems
DOI10.1090/S0025-5718-2010-02443-3zbMath1220.65064OpenAlexW1966549141MaRDI QIDQ3015053
No author found.
Publication date: 8 July 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2010-02443-3
fixed pointsnumerical resultsNewton-Raphson methodcircumscribed ellipsoid algorithmnonexpanding functions
Numerical computation of solutions to systems of equations (65H10) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-dimensional bisection envelope algorithm for fixed points
- Chaos and continued fractions
- Attractive cycles in the iteration of meromorphic functions
- Exponential lower bounds for finding Brouwer fixed points
- Complexity of fixed points. I
- A globally convergent algorithm for computing fixed points of \(C^2\) maps
- A comparison of point and ball iterations in the contractive mapping case
- Rank-one modification of the symmetric eigenproblem
- A recursive algorithm for the infinity-norm fixed point problem
- Ill-posed problems with a priori information
- Approximating fixed points of weakly contracting mappings
- An ellipsoid algorithm for the computation of fixed points
- A note on two fixed point problems
- Circumscribed ellipsoid algorithm for fixed-point problems
- Algorithm 848
- On algorithms for discrete and approximate brouwer fixed points
- A Fully Parallel Algorithm for the Symmetric Eigenvalue Problem
- Polynomial algorithms in linear programming
- Feature Article—The Ellipsoid Method: A Survey
- A Better Estimate for Fixed Points of Contractions
- On the Orthogonality of Eigenvectors Computed by Divide-and-Conquer Techniques
- A Numerical Verification Method for Solutions of Boundary Value Problems with Local Uniqueness by Banach's Fixed-Point Theorem
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- Algorithm 768: TENSOLVE
- Homotopies for computation of fixed points
- A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures
- A generalization of the Lefschetz fixed point theorem and detection of chaos
- Algorithm 825
- The Approximation of Fixed Points of a Continuous Mapping
- The Core of an N Person Game
- Some Modified Matrix Eigenvalue Problems
- Homotopies for computation of fixed points on unbounded regions
This page was built for publication: Circumscribed ellipsoid algorithm for fixed-point problems
