Fibre contraction principle with respect to an iterative algorithm (Q472517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fibre contraction principle with respect to an iterative algorithm |
scientific article; zbMATH DE number 6371129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fibre contraction principle with respect to an iterative algorithm |
scientific article; zbMATH DE number 6371129 |
Statements
Fibre contraction principle with respect to an iterative algorithm (English)
0 references
19 November 2014
0 references
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.
0 references
0 references
0.8672751
0 references
0.8581774
0 references
0.81390893
0 references
