Abstract
This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms [InlineEquation not available: see fulltext.] for [InlineEquation not available: see fulltext.] and [InlineEquation not available: see fulltext.], or [InlineEquation not available: see fulltext.], subject to [InlineEquation not available: see fulltext.] and [InlineEquation not available: see fulltext.], such that [InlineEquation not available: see fulltext.] converges uniformly to T, and the distances [InlineEquation not available: see fulltext.] are iteration-dependent, where [InlineEquation not available: see fulltext.], [InlineEquation not available: see fulltext.], [InlineEquation not available: see fulltext.] and [InlineEquation not available: see fulltext.] are non-empty subsets of X, for [InlineEquation not available: see fulltext.], where [InlineEquation not available: see fulltext.] is a metric space, provided that the set-theoretic limit of the sequences of closed sets [InlineEquation not available: see fulltext.] and [InlineEquation not available: see fulltext.] exist as [InlineEquation not available: see fulltext.] and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical identification of dynamic systems.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer





