Cascade search principle and its applications to the coincidence problems of n one-valued or multi-valued mappings

The author establishes the following result: Let \((X,P)\) be a metric space, \(\phi: x\to \mathbb R\) be a nonnegative functional with its nonempty nil-subspace \(\text{Nil}(\varphi)=A\subset X\). Suppose that either \(Graph(\varphi)\) is o-complete or \(X\) is complete and Graph \((\varphi)\) is o-closed. Let the functional \(\varphi\) be \((\alpha,\beta)\)-search on \(X\) for some numbers \(\alpha\), \(\beta\) with \(0<\beta<\alpha\). Then there exists a multi-cascade on \(X\) with the limit set \(A\), and the disctance between any initial point \(x_0\in X\) and every corresponding limit point is not greater than \(\frac{\varphi(x_0)}{\alpha-\beta}\). This principle implies a generalization of the Banach fixed point principle. This generalization is stated.

Recommendations

Cites work

Cited in

(29)

This page was built for publication: Cascade search principle and its applications to the coincidence problems of \(n\) one-valued or multi-valued mappings

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