1. Introduction and Preliminaries
The conventional Banach contraction principle (BCP), which declares that a contraction on a complete metric space has a unique fixed point and plays an intermediate role in nonlinear analysis. Because of its significance and accessibility, various authors have established numerous interesting supplements and modifications of the BCP; see References  [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25,
26,
27,
28] and the references therein. Edelstein [
13] obtained the following result for compact metric space.
Theorem 1 ([13]). Let  be a compact metric space and let  be a self-mapping. Assume thatholds for all  with . Then, there exists a unique  in M such that   Jleli et al. [
20] initiated a new version of the contraction which is known as an 
-contraction and proved the new results for such contractions in the setting of generalized metric spaces.
Definition 1. Let  be a mapping satisfying:
- ()  is nondecreasing; 
- () for any sequence ,  
- () there exists  and  such that  
 A self mapping 
 is an 
-contraction if there exists a function 
 satisfying (
)–(
) and a constant 
 such that
      
      for all 
.
Theorem 2 ([20]). Let  be a complete metric space and  be an Θ-contraction, then there exists a unique  in M such that 
 The authors in Reference [
20] manifested that a Banach contraction is a specific case of an 
-contraction although there are many 
-contractions which need not be Banach contractions. We express by the 
 the set of all functions 
 satisfying the above conditions (
)–(
).
Recently, Sawangsup et al. [
28] defined a 
-contraction and proved some fixed point theorems including binary relations. Now we give some definitions regarding binary relation.
Definition 2 ([22]). A binary relation on M is a nonempty subset R of . It is transitive if  R for all  whenever  R and 
 If R, then we express it by  and it is said that “u is related to v”. Throughout this paper, we take R as a binary relation on a nonempty subset M and  as a metric space equipped with a binary relation R.
Definition 3 ([8]). If  is a self mapping. Then, R is said to be F-closed if for each ,  R implies .
 According to Reference [
26], the foregoing property 
F-closed holds if 
F is nondecreasing.
Definition 4 ([21]). For , a path of length k in R from u to v (where k is a natural number) is a finite sequence  satisfying the following assertions:
(i)  and 
(ii)  for all 
 We express by  the family of all paths in binary relations R from u to v.
Definition 5 ([26]). A  is said to be R-nondecreasing-regular if for any ,  Definition 6 ([27]). Let . An element  is a fixed point of the mapping F of N-order if Let  be a self mapping. We express by 
 The purpose of this article is to introduce the idea of an -contraction where R is a binary relation and then establish some results in this way. We also apply our main results to examine a family of nonlinear matrix equation as an application.
  2. Results
We begin this section by defining an -contraction for the class of functions  and obtain confident results involving a binary relation.
Definition 7. A self-mapping  is said to be an -contraction if there are  and  such thatfor all .  Now, we present our main result.
Theorem 3. Let  be a self-mapping satisfying the following properties:
- (i) 
- ; 
- (ii) 
- R is F-closed’; 
- (iii) 
- F is continuous; 
- (iv) 
- F is a -contraction. 
Then, there exists  in M such that 
 Proof.  Let 
 be an arbitrary point. For such 
, we construct the sequence 
 by 
 for all 
 If there exists 
 such that 
 then 
 is a fixed point of 
F and we are done. Hence, we suppose, 
 and so 
 for all 
. As 
 and 
R is 
F-closed, so we have 
 for all 
 Thus, 
 for all 
 Since 
F is a 
-contraction, we get
        
        for all 
. Letting 
 in (4), we get
        
By (
), there exist 
 and 
 such that
        
Let 
 In this case, let 
 So there exists 
 such that
        
		for all 
 This implies that
        
		for all 
 Then,
		
		for all 
 where 
 Now, we suppose that 
 Let 
 be an arbitrary positive number. Then, there exists 
 such that
		
		for all 
 This implies that
		
		for all 
 where 
 Hence, in all ways, there exist 
 and 
 such that
		
		for all 
 Thus, by Equations (4) and (8), we get
		
Thus, there exists 
 such that
        
		for all 
 For 
 we obtain
		
Since , then  converges. Therefore,  as  Thus, we proved that  is a Cauchy sequence in M. The completeness of M assures that there exists  such that,  Now, by the continuity of F, we get  and so  is a fixed point of F. □
 Remark 1. From the proof of Theorem 3, we observe that for each , the Picard sequence  converges to the fixed point of 
 By avoiding the continuity of F, we have the following result.
Theorem 4. Theorem 3 also holds if we replace hypotheses (iii) with following one:
 - (iii)
-  is R-nondecreasing-regular. 
Proof.  By Theorem 3, we have proved that there exists  such that,  As  for all  then  for all  We review the following two cases counting on set  □
 - If  M- =finite, then there exists  -  such that  -  for all  -  Specifically,  -  and  -  for all  -  so
           - 
		  for each  -  As  - , axiom ( - ) implies that  - . Hence,  - , so  - . Thus,  - . 
- If the set M is not finite, then there exists a subsequence  of  such that  for all  As →, then . In both cases,  is a fixed point of F. 
Now, we prove that the obtained fixed point in Theorems 3 and 4 is unique.
Theorem 5. Suppose that the binary relation R is transitive on M and  is nonempty, for all : w is a fixed point of F} is as an addition to the hypotheses of Theorem 3 (respectively, Theorem 4). Then,  is unique.
 Proof.  Let 
u and 
v be such that
        
		Then, 
. Since 
. So there exists a 
 from 
u to 
v in 
R, so that
        
As 
R is transitive, so we have
        
Thus from Equation (
12), we have
        
		a contradiction because 
 Thus, 
. □
   3. Multidimensional Results
Now we establish some multidimensional theorems from the above-mentioned results by identifying some very easy tools. We express by 
 the binary relation on 
 defined by
	  
	⟺
	
If 
, let us express by 
 the class of all points 
 such that
	  
	that is,
	
Definition 8 ([28]). If  and . A binary relation R on M is said to be -closed if for any , , Let us express by  the mapping  Lemma 1 ([28]). Given  and , a point ∈ is a fixed point of N-order of F if it is a fixed point of 
 Lemma 2 ([28]). Given  and , then R is -closed if it is -closed defined on .
 Lemma 3 ([28]). Given  and , a point ∈ if and only if ∈
 Lemma 4 ([28]). Let  given byfor all  Then, the following assertions hold.  -  is also a metric space. 
- Let  be a sequence in  and let . Then, ⇔ for all . 
- If  is a sequence in , then  is -Cauchy ⇔ is Cauchy for all . 
-  is complete ⇔ is complete. 
Definition 9 ([28]). For , a path of length k in  from  to  is a finite sequence  satisfying the following conditions:
- (i) 
-  and ; 
- (ii) 
- () for all  
 Consistent with Reference [
28], we denote by 
 the class of all paths in 
 from 
 to 
Definition 10. Let  be a given mapping and let us denote We say that F is an -contraction if there are some  and  such thatfor each   Theorem 6. Let  be a mapping. Suppose that the following assertions hold:
- (i) 
- ; 
- (ii) 
- R is -closed’; 
- (iii) 
- F is continuous; 
- (iv) 
- F is a -contraction. 
 Then, F has a fixed point of N-order.
Proof.   is a complete metric space by 1 and 4 of Lemma 4. By Lemma 2, the binary relation  defined on  is -closed. Suppose that ∈. By Lemma 3, we obtain that ∈. Since F is continuous, we conclude that  is also continuous. From the  -contractive condition of F, we conclude that  is also  -contraction. By Theorem 3, there exists  such that  that is  is a fixed point of . Using Lemma 2,  is a fixed point of F of N-order. □
 Theorem 7. Let  be a mapping. Assume that the following assertions hold:
- (i) 
- ; 
- (ii) 
- R is -closed’; 
- (iii) 
-  is N-nondecreasing-regular; 
- (iv) 
- F is a -contraction. 
 Then, F has a fixed point of N-order.
Theorem 8. In addition to the hypotheses of Theorem 6 (respectively, Theorem 7), assume that R is a transitive relation on M and  is nonempty for each Then, F has a unique fixed point of N-order.
   4. Applications in Relation to Nonlinear Matrix Equations
Fixed point theorems for various functions in ordered metric spaces have been broadly explored and many applications in different branches of the sciences and mathematics have been found especially relating to differential, integral, and matrix equations (see References [
6,
14,
25] and references therein).
Let us denote 
 set of all 
 complex matrices, 
 set of all Hermitian matrices in 
, 
= the family of all positive definite matrices in 
, and 
= the class of all positive semidefinite matrices in 
. For 
 we write 
 Furthermore, 
 means 
 The symbol 
 is used for the spectral norm of 
A defined by 
 where 
 is the largest eigenvalue of 
 where 
 is the conjugate transpose of 
A. In addition, 
 where 
 (
) are the singular values of 
 Here, (
) is complete metric space (for more details see References [
11,
12,
25]). Moreover, the binary relation ⪯ on 
 defined by: 
 for all 
∈
.
In this section, we apply our results to establish a solution of the nonlinear matrix equation.
      
      where 
 is a continuous order preserving mapping with 
, 
Q is a Hermitian positive definite matrix, and 
 are any 
 matrices and 
 their conjugates.
Now we state the the following lemmas which are helpful in the next results.
Lemma 5 ([25]). Let  such that  and . Then,  Lemma 6 ([23]). If  such that  then 
 Theorem 9. Consider the matrix Equation (14). Assume that there are positive real numbers L and  such that: - (i) 
- For  with  and  we have 
- (ii) 
-  and  
Then, Equation (12) has a solution. Moreover, the iterationwhere  satisfies  converges to the solution of Equation (12).  Proof.  Define 
 by
		
		for all 
 Then, 
 is well defined, the order ⪯ on 
 is 
-closed. Here, the solution of Equation (
14) is actually a fixed point of 
 and we have to show that 
 is an 
-contraction mapping due to some 
 and 
 defined by
        
        for all 
 Let 
 be such that 
 and 
 which further implies that 
 Since 
 is an order preserving, we have 
. Thus,
        
        which further implies that
        
We have
        
        which proves that 
 is an 
-contraction. By 
 we get 
. Therefore, that 
 Thus, by Theorem 3, ∃
 such that 
, that is, Equation (
14) has a solution. □
 Example 1. Consider the matrix equationwhere  and  are given by Define  byfor all  and  and  by  Then, conditions (i) and (ii) of Theorem 9 are satisfied for  by using the iterative sequencewith After 19 iterations, we get the unique solutionof the matrix Equation (15). The residual error is .  Theorem 10. With the assumptions of Theorem 9, Equation (15) has a unique solution   Proof.  Since for 
∃ a greatest lower bound and a least upper bound. So we have 
, for each 
 Thus, we conclude by Theorem 5 that 
 has a unique fixed point in 
 which implies that Equation (
15) has a unique solution in 
. □