Pages that link to "Item:Q1714732"
From MaRDI portal
The following pages link to Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse (Q1714732):
Displaying 15 items.
- An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix (Q279057) (← links)
- Finding generalized inverses by a fast and efficient numerical method (Q482683) (← links)
- Low-complexity inverse square root approximation for baseband matrix operations (Q630824) (← links)
- A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix (Q846447) (← links)
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices (Q1713175) (← links)
- A new iterative method for finding approximate inverses of complex matrices (Q1724392) (← links)
- New mono- and biaccelerator iterative methods with memory for nonlinear equations (Q1724774) (← links)
- A family of iterative methods for computing Moore-Penrose inverse of a matrix (Q1932581) (← links)
- An efficient matrix iterative method for computing Moore-Penrose inverse (Q2223078) (← links)
- Multipoint iterative methods for finding all the simple zeros in an interval (Q2336572) (← links)
- An approach to the approximation of the inverse of a square matrix by He's homotopy perturbation method (Q2890654) (← links)
- (Q3189157) (← links)
- (Q3408812) (← links)
- The CEPGD-inverse for square matrices (Q6071342) (← links)
- GIBS: a general and efficient iterative method for computing the approximate inverse and Moore–Penrose inverse of sparse matrices based on the Schultz iterative method with applications (Q6175916) (← links)
