Acceleration of iteration methods for interval fixed point problems

Let \(I(\mathbb R^n)\) denote the collection of all closed intervals in \(\mathbb R^n\). The paper deals with the fixed point equation \(x=F(x)\) with a continuous and inclusion isotone function \(F:I(\mathbb R^n)\to I(\mathbb R^n)\). For \(x^0\in I(\mathbb R^n)\) with \(F(x^0)\subseteq x^0\) the iteration \(x^{k+1}:=F(x^k)\) converges monotonically (\(x^{k+1}\subseteq x^k\)) to a fixed point of \(F\). The author modifies this iteration in order to accelerate convergence without losing monotonicity: \(y^k=[y^k_l,y^k_r]:= F(x^k)\), \(x^{k+1}:=[y^k_l+v^k, y^k_r-v^k]\), with a suitable vector \(v^k\). The investigation concentrates on the problem how to choose \(v^k\). Numerical examples demonstrate the behavior of the presented method.

Recommendations

Cites work

Cited in

(5)

Describes a project that uses

Uses Software

PASCAL-XSC

This page was built for publication: Acceleration of iteration methods for interval fixed point problems

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