Best proximity points of (EP)-operators with qualitative analysis and simulation

Gabriela Ioana Usurelu and Teodor Turcanu

Mathematics and Computers in Simulation (MATCOM), 2021, vol. 187, issue C, 215-230

Abstract: In this paper, we analyze a Thakur three-step iterative process adapted for the context of non-self-mappings. Based on this iteration, we state and prove the existence of best proximity points for the recently introduced class of (EP)-non-self-mappings. Under certain assumptions, we study the convergence of the considered Thakur process to a best proximity point for the same class of operators. Moreover, we design a CQ-type algorithm which strongly converges to a best proximity point of such kind of mappings. In addition, we present the CQ-variant of the proposed algorithm that strongly converges to a best proximity pair. Some examples and numerical simulations sustain the efficiency of our new algorithms.

Keywords: Best proximity point; Non-self mapping; CQ algorithm; P-property; Hybrid algorithm (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475421000616
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:187:y:2021:i:c:p:215-230

DOI: 10.1016/j.matcom.2021.02.022

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().