Cascade search for preimages and coincidences: global and local versions (Q1947780): Difference between revisions

The paper presents a generalization of the cascade search principle. This principle allows the author to construct a set-valued self map of a metric space \(X\) from a set-valued functional or a collections of set-valued maps of \(X\) so that the new map generates a multicascade, i.e. a set-valued discrete dynamical system whose limit set coincides with the zero set of the given functional. In the first part of the paper the author presents a generalized version of the cascade principle searching for the zeros of a set-valued functional using the points of its graph. The second part of the paper deals with a local version of the cascade search principle and its applications to searching for approximating common preimages and, in particular, common roots of a finite collection of set-valued maps in a neighborhood of a given initial point. The local search and approximation problem is solved for the set of those coincidence points of a given finite collection of set-valued maps at which some of the common values belong to a fixed neighborhood of a given closed subspace. An relevant example is also given.