Pages that link to "Item:Q445846"
From MaRDI portal
The following pages link to Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix (Q445846):
Displayed 15 items.
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination (Q278622) (← links)
- Two inverse-of-\(N\)-free methods for \(A_{M,N}^\dagger\) (Q1646069) (← links)
- The representations and computations of generalized inverses \(A^{(1)}_{T,S}\), \(A^{(1,2)}_{T,S}\) and the group inverse (Q1697272) (← links)
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\) (Q1724477) (← links)
- An efficient method to compute different types of generalized inverses based on linear transformation (Q2008934) (← links)
- Theory of functional connections applied to quadratic and nonlinear programming under equality constraints (Q2074867) (← links)
- A divide-and-conquer approach for the computation of the Moore-Penrose inverses (Q2180674) (← links)
- An efficient method for computing the outer inverse \(A_{T,S}^{(2)}\) through Gauss-Jordan elimination (Q2192574) (← links)
- Two closed novel formulas for the generalized inverse \(A_{T,S}^{(2)}\) of a complex matrix with given rank (Q2301649) (← links)
- Gauss-Jordan elimination method for computing all types of generalized inverses related to the {1}-inverse (Q2357418) (← links)
- Computing the outer and group inverses through elementary row operations (Q2397293) (← links)
- Computation of weighted Moore-Penrose inverse through Gauss-Jordan elimination on bordered matrices (Q2423120) (← links)
- Innovation based on Gaussian elimination to compute generalized inverse \(A_{T,S}^{(2)}\) (Q2629423) (← links)
- Methods of Gauss–Jordan elimination to compute core inverse and dual core inverse (Q5095244) (← links)
- The Core-EP, Weighted Core-EP Inverse of Matrices and Constrained Systems of Linear Equations (Q5099126) (← links)
