Fibre contraction principle with respect to an iterative algorithm

From MaRDI portal





Summary: We apply the fibre contraction principle in the case of a general iterative algorithm to approximate the fixed point of triangular operator using the admissible perturbation. A simple example and an application to a functional equation with parameter are given in order to illustrate the abstract results and to show the role of admissible perturbations.











This page was built for publication: Fibre contraction principle with respect to an iterative algorithm

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