| dc.contributor.author | Abu Iram, Zainab | |
| dc.contributor.author | Zein, Ali | |
| dc.date.accessioned | 2023-05-28T09:30:39Z | |
| dc.date.available | 2023-05-28T09:30:39Z | |
| dc.date.issued | 2022-08-12 | |
| dc.identifier.issn | 1314-8060 | |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/8868 | |
| dc.description.abstract | A new family of second-order iterative algorithms for computing the Moore-Penrose inverse is developed. The construction of this algorithm is based on the usage of Penrose Equations (1) and (2). Convergence properties are considered. Numerical results are also presented and a comparison with Newton’s method is made. It is observed that the new methods require less number of iterations than that of Newton’s method. In addition, numerical experiments show that these methods are more effective than Newton’s method when the number of columns increases than the number of rows | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | International Journal of Applied Mathematics | en_US |
| dc.relation.ispartofseries | 35;3 | |
| dc.subject | generalized inverse; Moore-Penrose inverse; iterative method; Penrose equations | en_US |
| dc.title | Anew family of second-order iterative methods for computing the Moore-Penrose inverse based on Penrose equations | en_US |
| dc.type | Article | en_US |