Pages that link to "Item:Q972937"
From MaRDI portal
The following pages link to Method of elementary transformation to compute Moore-Penrose inverse (Q972937):
Displaying 16 items.
- A new method for computing Moore-Penrose inverse through Gauss-Jordan elimination (Q278622) (← links)
- Improved Qrginv algorithm for computing Moore-Penrose inverse matrices (Q469946) (← links)
- An improved method for the computation of the Moore-Penrose inverse matrix (Q555385) (← links)
- Neural network for computing pseudoinverses and outer inverses of complex-valued matrices (Q668584) (← links)
- Execute elementary row and column operations on the partitioned matrix to compute M-P inverse \(A^!\) (Q1724477) (← links)
- Discrete-time noise-tolerant Zhang neural network for dynamic matrix pseudoinversion (Q2001149) (← links)
- An efficient method to compute different types of generalized inverses based on linear transformation (Q2008934) (← links)
- A divide-and-conquer approach for the computation of the Moore-Penrose inverses (Q2180674) (← links)
- One-sided weighted outer inverses of tensors (Q2223863) (← links)
- Exact solutions and convergence of gradient based dynamical systems for computing outer inverses (Q2246062) (← 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)
- A parallel computing method based on zeroing neural networks for time-varying complex-valued matrix Moore-Penrose inversion (Q2663568) (← links)
- Composite outer inverses for rectangular matrices (Q5152060) (← links)
- A Novel Iterative Method for Computing Generalized Inverse (Q5378328) (← links)
