A two-dimensional bisection envelope algorithm for fixed points
From MaRDI portal
(Redirected from Publication:700187)
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
Cites work
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- An ellipsoid algorithm for the computation of fixed points
- Approximating fixed points of weakly contracting mappings
- Exponential lower bounds for finding Brouwer fixed points
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- Optimal solution of nonlinear equations
- The Approximation of Fixed Points of a Continuous Mapping
Cited in
(10)- A recursive algorithm for the infinity-norm fixed point problem
- Exponential lower bounds for finding Brouwer fixed points
- Algorithms for projecting a point onto a level surface of a continuous function on a compact set
- On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications
- Application of Canonical Duality Theory to Fixed Point Problem
- Circumscribed ellipsoid algorithm for fixed-point problems
- The bisection method in higher dimensions
- A note on two fixed point problems
- Algorithm 825
- Algorithm 848
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)
