A Family of Arbitrary High-Order Iterative Methods for Approximating Inverse and the Moore–Penrose Inverse
In this work, a family of iterative algorithms for approximating the inverse of a square matrix and the Moore-Penrose inverse of a non-square one is proposed. These methods are based on arbitrary high-order iterative techniques which are used for computing roots of a nonlinear function. Therefore th...
Main Author: | Esmaeil Kokabifar |
---|---|
Format: | Article |
Language: | English |
Published: |
Emrah Evren KARA
2020-06-01
|
Series: | Communications in Advanced Mathematical Sciences |
Subjects: | |
Online Access: | https://dergipark.org.tr/tr/download/article-file/1177955 |
Similar Items
-
Existence of Moore-Penrose inverses in rings with involution
by: Wannisa Apairat, et al.
Published: (2018-10-01) -
An efficient hyperpower iterative method for computing weighted MoorePenrose inverse
by: Manpreet Kaur, et al.
Published: (2020-02-01) -
Further representations and computations of the generalized Moore-Penrose inverse
by: Kezheng Zuo, et al.
Published: (2023-07-01) -
On the Calculation of the Moore–Penrose and Drazin Inverses: Application to Fractional Calculus
by: Khosro Sayevand, et al.
Published: (2021-10-01) -
Calculating the Weighted Moore–Penrose Inverse by a High Order Iteration Scheme
by: Haifa Bin Jebreen
Published: (2019-08-01)