A two-dimensional bisection envelope algorithm for fixed points
From MaRDI portal
Publication:700187
DOI10.1006/JCOM.2001.0625zbMATH Open1035.65053OpenAlexW2743986995MaRDI QIDQ700187FDOQ700187
Authors: Spencer D. Shellman, Krzysztof A. Sikorski
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
Recommendations
- Algorithm 825
- Two-scale methods for convex envelopes
- A two-dimensional generalization of the Bauer algorithm
- scientific article; zbMATH DE number 4100559
- Publication:4885379
- An ellipsoid algorithm for the computation of fixed points
- A new numerical algorithm for two-point boundary value problems
- An algorithm for pointwise evaluation of polyconvex envelopes. II: generalization and numerical results
- scientific article; zbMATH DE number 123812
- scientific article; zbMATH DE number 4024646
fixed point probleminfinity normLipschitz continuous functionfixed points approximationstwo-dimensional bisection envelope algorithm
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Approximation of Fixed Points of a Continuous Mapping
- Homotopies for computation of fixed points
- Optimal solution of nonlinear equations
- Exponential lower bounds for finding Brouwer fixed points
- Homotopies for computation of fixed points on unbounded regions
- Approximating fixed points of weakly contracting mappings
- An ellipsoid algorithm for the computation of fixed points
Cited In (10)
- On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications
- The bisection method in higher dimensions
- Application of Canonical Duality Theory to Fixed Point Problem
- Algorithms for projecting a point onto a level surface of a continuous function on a compact set
- Algorithm 848
- A recursive algorithm for the infinity-norm fixed point problem
- Exponential lower bounds for finding Brouwer fixed points
- Algorithm 825
- Circumscribed ellipsoid algorithm for fixed-point problems
- A note on two fixed point problems
This page was built for publication: A two-dimensional bisection envelope algorithm for fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700187)