Common Fixed Point Theorems for Generalized R′-contraction in b-metric Spaces
Issue:
Volume 8, Issue 2, June 2022
Pages:
22-31
Received:
26 February 2022
Accepted:
8 April 2022
Published:
22 April 2022
DOI:
10.11648/j.ml.20220802.11
Downloads:
Views:
Abstract: In this paper, the researcher presents some common fixed point theorems for self-mappings satisfying generalized R′-contraction in b-metric spaces and obtained a unique common fixed point of a self-mapping satisfying certain contraction in the framework of b- metric spaces. The results presented over her generalize and extend some existing results in the literature. Finally, he illustrate example to support the results.
Abstract: In this paper, the researcher presents some common fixed point theorems for self-mappings satisfying generalized R′-contraction in b-metric spaces and obtained a unique common fixed point of a self-mapping satisfying certain contraction in the framework of b- metric spaces. The results presented over her generalize and extend some existing results ...
Show More
Comparison of Results for Some Different Methods of Determination of Fundamental Matrix of Linear Control Systems
Stephen Ekwueme Aniaku,
Emmanuel Chukwudi Mbah,
Christopher Chukwuma Asogwa
Issue:
Volume 8, Issue 2, June 2022
Pages:
32-36
Received:
11 March 2022
Accepted:
1 April 2022
Published:
28 July 2022
DOI:
10.11648/j.ml.20220802.12
Downloads:
Views:
Abstract: In this paper, three different methods of determination of fundamental matrix of Linear control systems, when the coefficient matrix A is not a nilpotent matrix are compared. In the case where A is nilpotent, the calculation is straight forward and easy. It only needs the calculation of eAt: The methods compared, in the case of A not being nilpotent are Faddeve Algorithm method, Sylvester Expansion Theorem method and Diagonalization method. Fundamental matrix plays a very big role in the determination of solution to linear control systems. Based on this, we have to look for the best method of determining it. Here, the level of problems and difficulties encountered in determining the fundamental matrix using these three methods were verified. Worked examples on the use of these three methods to determine the fundamental matrix were given and level of problems and difficulties examined. From the worked example, it was discovered that these three methods have different level of problems and difficulties in finding the fundamental matrix. It was then concluded that based on their different level of problems and difficulties, these methods were compared and conclusion derived. These three methods which are effective ways of determining Fundamental matrix of linear control systems will be preferred in this order: Faddeve Algoprithm method, Sylvester Expansion Theorem method and Diagonalization method.
Abstract: In this paper, three different methods of determination of fundamental matrix of Linear control systems, when the coefficient matrix A is not a nilpotent matrix are compared. In the case where A is nilpotent, the calculation is straight forward and easy. It only needs the calculation of eAt: The methods compared, in the case of A not being nilpoten...
Show More
Common Fixed Point Theorem for Four Self-Maps Satisfying (CLRST) Property for Generalized (ψ, φ) –Weakly Contraction in B-metric Space
Issue:
Volume 8, Issue 2, June 2022
Pages:
37-42
Received:
8 June 2022
Accepted:
16 September 2022
Published:
8 December 2022
DOI:
10.11648/j.ml.20220802.13
Downloads:
Views:
Abstract: This paper is devoted to obtain fixed point results. Fixed point theory is very wide field which have many application in different areas. The concept of altering distance to find fixed point results have been explored by many authors. In the present paper the author state altering distance function and ultra-altering distance function and the coincidence point for two self-mappings that satisfy the (CLRST) - property with the help of altering distance function and ultra-altering distance function in the context of b-metric spaces and achieve a unique common fixed point for two weakly compatible pairs. Many discoveries can also be derived from these main results in the framework of metric spaces.
Abstract: This paper is devoted to obtain fixed point results. Fixed point theory is very wide field which have many application in different areas. The concept of altering distance to find fixed point results have been explored by many authors. In the present paper the author state altering distance function and ultra-altering distance function and the coin...
Show More
