New Results for Weakly Compatible (WC) and R-Weakly Commuting (RWC) Mappings with an Applicationin Dynamic Programming

  • Penumarthy Parvateesam Murthy
  • , Sanjay Kumar
  • , Rajesh Kumar
  • , Pusplata Sahu
  • , Zoran D. Mitrović
  • , Reny George

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

The aim of this paper is to obtain some new results about common fixed points. Our results use weaker conditions than those previously used. We have relaxed the conditions for commutating pair mappings and compatible mappings of the type (Formula presented.), which were introduced in 1976. The theorems are enriched by using the concept of (Formula presented.) and various types of weakly commuting pairs of maps in metric spaces. To discuss the existence and uniqueness of the common solutions, we have obtained an application to the functional equations in dynamic programming.

Original languageEnglish
Article number733
JournalFractal and Fractional
Volume6
Issue number12
DOIs
StatePublished - Dec 2022

Keywords

  • R-weakly commuting (RWC) mappings
  • dynamic programming (DP)
  • weak contraction
  • weakly compatible (WC) mappings

Fingerprint

Dive into the research topics of 'New Results for Weakly Compatible (WC) and R-Weakly Commuting (RWC) Mappings with an Applicationin Dynamic Programming'. Together they form a unique fingerprint.

Cite this