An efficient hyperpower iterative method for computing weighted MoorePenrose inverse

In this paper, we propose a new hyperpower iterative method for approximating the weighted Moore-Penrose inverse of a given matrix. The main objective of the current work is to minimize the computational complexity of the hyperpower iterative method using some transformations. The proposed method at...

Full description

Bibliographic Details
Main Authors: Manpreet Kaur, Munish Kansal, Sanjeev Kumar
Format: Article
Language:English
Published: AIMS Press 2020-02-01
Series:AIMS Mathematics
Subjects:
Online Access:https://www.aimspress.com/article/10.3934/math.2020113/fulltext.html
id doaj-73c75306cde94193bb128cff5505804a
record_format Article
spelling doaj-73c75306cde94193bb128cff5505804a2020-11-25T02:40:44ZengAIMS PressAIMS Mathematics2473-69882020-02-01531680169210.3934/math.2020113An efficient hyperpower iterative method for computing weighted MoorePenrose inverseManpreet Kaur Munish Kansal0Sanjeev Kumar1School of Mathematics, Thapar Institute of Engineering and Technology, Patiala 147004, IndiaSchool of Mathematics, Thapar Institute of Engineering and Technology, Patiala 147004, IndiaIn this paper, we propose a new hyperpower iterative method for approximating the weighted Moore-Penrose inverse of a given matrix. The main objective of the current work is to minimize the computational complexity of the hyperpower iterative method using some transformations. The proposed method attains the fifth-order of convergence using four matrix multiplications per iteration step. The theoretical convergence analysis of the method is discussed in detail. A wide range of numerical problems is considered from scientific literature, which demonstrates the applicability and superiority of the proposed method.https://www.aimspress.com/article/10.3934/math.2020113/fulltext.htmlweighted moore-penrose inverserank-deficient matrixhyperpower iterative methodmatrix multiplicationgeneralized inverse
collection DOAJ
language English
format Article
sources DOAJ
author Manpreet Kaur
Munish Kansal
Sanjeev Kumar
spellingShingle Manpreet Kaur
Munish Kansal
Sanjeev Kumar
An efficient hyperpower iterative method for computing weighted MoorePenrose inverse
AIMS Mathematics
weighted moore-penrose inverse
rank-deficient matrix
hyperpower iterative method
matrix multiplication
generalized inverse
author_facet Manpreet Kaur
Munish Kansal
Sanjeev Kumar
author_sort Manpreet Kaur
title An efficient hyperpower iterative method for computing weighted MoorePenrose inverse
title_short An efficient hyperpower iterative method for computing weighted MoorePenrose inverse
title_full An efficient hyperpower iterative method for computing weighted MoorePenrose inverse
title_fullStr An efficient hyperpower iterative method for computing weighted MoorePenrose inverse
title_full_unstemmed An efficient hyperpower iterative method for computing weighted MoorePenrose inverse
title_sort efficient hyperpower iterative method for computing weighted moorepenrose inverse
publisher AIMS Press
series AIMS Mathematics
issn 2473-6988
publishDate 2020-02-01
description In this paper, we propose a new hyperpower iterative method for approximating the weighted Moore-Penrose inverse of a given matrix. The main objective of the current work is to minimize the computational complexity of the hyperpower iterative method using some transformations. The proposed method attains the fifth-order of convergence using four matrix multiplications per iteration step. The theoretical convergence analysis of the method is discussed in detail. A wide range of numerical problems is considered from scientific literature, which demonstrates the applicability and superiority of the proposed method.
topic weighted moore-penrose inverse
rank-deficient matrix
hyperpower iterative method
matrix multiplication
generalized inverse
url https://www.aimspress.com/article/10.3934/math.2020113/fulltext.html
work_keys_str_mv AT manpreetkaur anefficienthyperpoweriterativemethodforcomputingweightedmoorepenroseinverse
AT munishkansal anefficienthyperpoweriterativemethodforcomputingweightedmoorepenroseinverse
AT sanjeevkumar anefficienthyperpoweriterativemethodforcomputingweightedmoorepenroseinverse
AT manpreetkaur efficienthyperpoweriterativemethodforcomputingweightedmoorepenroseinverse
AT munishkansal efficienthyperpoweriterativemethodforcomputingweightedmoorepenroseinverse
AT sanjeevkumar efficienthyperpoweriterativemethodforcomputingweightedmoorepenroseinverse
_version_ 1724780106800431104