Execute elementary row and column operations on the partitioned matrix to compute M-P inverse A^!
Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
Summary: We first study the complexity of the algorithm presented in [\textit{W. Guo} and \textit{T. Huang}, Appl. Math. Comput. 216, No. 5, 1614--1617 (2010; Zbl 1200.65027)]. After that, a new explicit formula for computational of the Moore-Penrose inverse \(A^!\) of a singular or rectangular matrix \(A\). This new approach is based on a modified Gauss-Jordan elimination process. The complexity of the new method is analyzed and presented and is found to be less computationally demanding than the one presented in [loc. cit.]. In the end, an illustrative example is demonstrated to explain the corresponding improvements of the algorithm.
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
- A note of computation for M-P inverse \(A^{\dagger }\)
- Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
- Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices
- A computing method for the Moore-Penrose inverse of some special matrices
- A note of computation for M-P inverse \(A^{\dagger }\)
- Algebraic perturbation methods for the solution of singular linear systems
- An improved method for the computation of the Moore-Penrose inverse matrix
- Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration
- Explicit expressions of the generalized inverses and condensed Cramer rules
- Gauss-Jordan elimination method for computing outer inverses
- Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix
- Generalized inverses. Theory and applications.
- scientific article; zbMATH DE number 4179553 (Why is no real title available?)
- scientific article; zbMATH DE number 3648910 (Why is no real title available?)
- scientific article; zbMATH DE number 5127891 (Why is no real title available?)
- scientific article; zbMATH DE number 1921313 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- Method of elementary transformation to compute Moore-Penrose inverse
- Minors of the Moore-Penrose inverse
- On the Continuity of the Generalized Inverse
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- Perturbation theory for pseudo-inverses
- The Moore--Penrose Generalized Inverse for Sums of Matrices
- A matrix iteration for finding Drazin inverse with ninth-order convergence
- An efficient method to compute different types of generalized inverses based on linear transformation
- A divide-and-conquer approach for the computation of the Moore-Penrose inverses
- Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank
- Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse
- Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination
- A note of computation for M-P inverse \(A^{\dagger }\)
- Methods of Gauss-Jordan elimination to compute core inverse \(A^{\text{\textcircled{\#}}}\) and dual core inverse \(A_{\text{\textcircled{\#}}}\)
- A novel method for computing core-EP inverse through elementary transformation
This page was built for publication: Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724477)
