Dilan Ahmed
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dilan Ahmed has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Karwan Hama Faraj Jwamer
College of Science, University of Sulaimani, Sulaymaniyah, Iraq
3 shared publications - Mudhafar Fattah Hama
University of Sulaymani
3 shared publications - Stanford Shateyi
Department of Mathematics and Applied Mathematics, School of Mathematical and Natural Sciences, University of Venda, P. Bag X5050, Thohoyandou 0950, South Africa
2 shared publications - H.M. Hasan
Univ Sulaimani, Sulaimani, Kurdistan Regio, Iraq
1 shared publication - Jarosław Woźniak
West Pomeranian University of Technology in Szczecin
1 shared publication - Javad Golzarpoor
Department of Science, School of Mathematical Sciences, University of Zabol, Zabol 98613-35856, Iran
1 shared publication
Latest Publications
- Open Access
- 24 June 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (13) , 2200
Constructing a Matrix Mid-Point Iterative Method for Matrix Square Roots and Applications
In this paper, an improvement to the mid-point method is contributed for finding the square root of a matrix as well as its inverse. To this aim, an iteration scheme to find this matrix function is constructed, and its error and stability estimates are provided to show the theoretical rate of convergence. Our higher-order method can compete with the existing iterative methods of a similar nature. This is illustrated in numerical simulations of various sizes.
- 24 June 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (13) , 2200
Open AccessConstructing a Matrix Mid-Point Iterative Method for Matrix Square Roots and Applications
In this paper, an improvement to the mid-point method is contributed for finding the square root of a matrix as well as its inverse. To this aim, an iteration scheme to find this matrix function is constructed, and its error and stability estimates are provided to show the theoretical rate of convergence. Our higher-order method can compete with the existing iterative methods of a similar nature. This is illustrated in numerical simulations of various sizes.
- 1 January 2021
- Published by Karagandy University of the name of academician E.A. Buketov in BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS
- Vol. 103 (3) , 25-35
Central Limit Theorem in View of Subspace Convex-Cyclic Operators
- 1 January 2021
- Published by Karagandy University of the name of academician E.A. Buketov in BULLETIN OF THE KARAGANDA UNIVERSITY-MATHEMATICS
- Vol. 103 (3) , 25-35
Central Limit Theorem in View of Subspace Convex-Cyclic Operators
- 25 September 2020
- Published by National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka) (Publications) in Zurnal matematiceskoj fiziki, analiza, geometrii
- Vol. 16 (4) , 473-489
On Subspace Convex-Cyclic Operators
- 25 September 2020
- Published by National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka) (Publications) in Zurnal matematiceskoj fiziki, analiza, geometrii
- Vol. 16 (4) , 473-489
On Subspace Convex-Cyclic Operators
- Open Access
- 12 July 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (7) , 622
A Seventh-Order Scheme for Computing the Generalized Drazin Inverse
One of the most important generalized inverses is the Drazin inverse, which is defined for square matrices having an index. The objective of this work is to investigate and present a computational tool in the form of an iterative method for computing this task. This scheme reaches the seventh rate of convergence as long as a suitable initial matrix is chosen and by employing only five matrix products per cycle. After some analytical discussions, several tests are provided to show the efficiency of the presented formulation.
- 12 July 2019
- Published by MDPI AG in Mathematics
- Vol. 7 (7) , 622
Open AccessA Seventh-Order Scheme for Computing the Generalized Drazin Inverse
One of the most important generalized inverses is the Drazin inverse, which is defined for square matrices having an index. The objective of this work is to investigate and present a computational tool in the form of an iterative method for computing this task. This scheme reaches the seventh rate of convergence as long as a suitable initial matrix is chosen and by employing only five matrix products per cycle. After some analytical discussions, several tests are provided to show the efficiency of the presented formulation.