Very recently, Mogbademu [6] answered in affirmative the open problem proposed in [9] by extending an iterative algorithm for two asymptotically pseudocontractive mappings to three mappings. He further asked if his results could be extended to the case of finite family of mappings. This sequel gives a positive answer to the open problem and equally extends so many results in this area of research.
We introduce the concept of Jav-distance (an analogue of b-metric), ϕp-proximal contraction, and ϕp-proximal cyclic contraction for non-self-mappings in Hausdorff uniform spaces. We investigate the existence and uniqueness of best proximity points for these modified contractive mappings. The results obtained extended and generalised some fixed and best proximity points results in literature. Examples are given to validate the main results.
We present the equivalence of some stochastic fixed point iterative algorithms by proving the equivalence between the convergence of random implicit Jungck-Kirk-multistep, random implicit Jungck-Kirk-Noor, random implicit Jungck-Kirk-Ishikawa, and random implicit Jungck-Kirk-Mann iterative algorithms for generalized -contractive-like random operators defined on separable Banach spaces.
The Hardy-Rogers p-proximal cyclic contraction, which includes the cyclic, Kannan, Chatterjea and Reich contractions as sub-classes, is developed in uniform spaces. The existence and uniqueness results of best proximity points for these contractions are proved. The results, which are for non-self maps, apart from the fact that they are new in literature, generalise several other similar results in literature. Examples are given to validate the results obtained.
MSC: 47H10; 54H25
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.