An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse
Authors
Abstract:
A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.
similar resources
An accelerated iterative method for computing weighted Moore-Penrose inverse
The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...
full textWhen Does the Moore–penrose Inverse Flip?
In this paper, we give necessary and sufficient conditions for the matrix [ a 0 b d ] , over a *-regular ring, to have a Moore-Penrose inverse of four different types, corresponding to the four cases where the zero element can stand. In particular, we study the case where the MoorePenrose inverse of the matrix flips. Mathematics subject classification (2010): 15A09, 16E50, 16W10.
full textMinors of the Moore - Penrose Inverse ∗
Let Qk,n = {α = (α1, · · · , αk) : 1 ≤ α1 < · · · < αk ≤ n} denote the strictly increasing sequences of k elements from 1, . . . , n. For α, β ∈ Qk,n we denote by A[α, β] the submatrix of A with rows indexed by α, columns by β. The submatrix obtained by deleting the α-rows and β-columns is denoted by A[α′, β′]. For nonsingular A ∈ IRn×n, the Jacobi identity relates the minors of the inverse A−1...
full textSymbolic computation of weighted Moore-Penrose inverse using partitioning method
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial matrix. These methods and algorithms are generalizations of the method or computing the weighted Moore-Penrose inverse for constant matrices, originated in [2...
full textEffective partitioning method for computing weighted Moore-Penrose inverse
We introduce a method and algorithm for computing the weighted MoorePenrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [24] to multiple variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Al...
full textMy Resources
Journal title
volume 10 issue 2
pages 221- 228
publication date 2018-04-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023