Pages that link to "Item:Q279057"
From MaRDI portal
The following pages link to An iterative method for computing the approximate inverse of a square matrix and the Moore-Penrose inverse of a non-square matrix (Q279057):
Displaying 20 items.
- Geometrical inverse preconditioning for symmetric positive definite matrices (Q515461) (← links)
- Numerical solution of nonlinear systems by a general class of iterative methods with application to nonlinear PDEs (Q742858) (← 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)
- On the extension of Householder's method for weighted Moore-Penrose inverse (Q1644552) (← links)
- Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse (Q1714732) (← links)
- A matrix iteration for finding Drazin inverse with ninth-order convergence (Q1722157) (← links)
- A new iterative method for finding approximate inverses of complex matrices (Q1724392) (← links)
- An efficient method to compute the Moore-Penrose inverse (Q1747875) (← links)
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) (Q2053113) (← links)
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse (Q2132907) (← links)
- An efficient matrix iterative method for computing Moore-Penrose inverse (Q2223078) (← links)
- Damage detection of cylindrical shells based on Sander's theory and model updating using incomplete modal data considering random noises (Q2224650) (← links)
- A general class of arbitrary order iterative methods for computing generalized inverses (Q2244155) (← links)
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications (Q2247163) (← links)
- A class of numerical algorithms for computing outer inverses (Q2252411) (← links)
- Finding the Moore-Penrose inverse by a new matrix iteration (Q2354185) (← links)
- Constructing two-step iterative methods with and without memory (Q2354433) (← links)
- An efficient quadratically convergent iterative method to find the Moore–Penrose inverse (Q4976308) (← links)
- EPEM: efficient parameter estimation for multiple class monotone missing data (Q6081289) (← 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)
