2017
DOI: 10.22436/jnsa.010.08.25
|View full text |Cite
|
Sign up to set email alerts
|

A coincidence-point problem of Perov type on rectangular cone metric spaces

Abstract: We consider a coincidence-point problem in the setting of rectangular cone metric spaces. Using α-admissible mappings and following Perov's approach, we establish some existence and uniqueness results for two self-mappings. Under a compatibility assumption, we also solve a common fixed-point problem.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
(15 reference statements)
0
1
0
Order By: Relevance
“…In this context, in 1964, Perov 2 generalized this principle for vector‐valued metric space. Later on, several contributions have been made (see in previous studies 3‐14 ). In order to talk about Perov's fixed point theorem, we need to recall some fundamental notations: Throughout this paper, we denote by m the set of m × 1 real matrices, by +m the set of m × 1 real matrices with nonnegative elements, by +jm the set of m × 1 real matrices in which every elements are greater than j , by θ the zero m × 1 matrix, by scriptMmmfalse(+false) the set of all m × m matrices with nonnegative elements, by Θ the zero m × m matrix, and by I the identity m × m matrix.…”
Section: Introductionmentioning
confidence: 99%
“…In this context, in 1964, Perov 2 generalized this principle for vector‐valued metric space. Later on, several contributions have been made (see in previous studies 3‐14 ). In order to talk about Perov's fixed point theorem, we need to recall some fundamental notations: Throughout this paper, we denote by m the set of m × 1 real matrices, by +m the set of m × 1 real matrices with nonnegative elements, by +jm the set of m × 1 real matrices in which every elements are greater than j , by θ the zero m × 1 matrix, by scriptMmmfalse(+false) the set of all m × m matrices with nonnegative elements, by Θ the zero m × m matrix, and by I the identity m × m matrix.…”
Section: Introductionmentioning
confidence: 99%