Pages that link to "Item:Q2929473"
From MaRDI portal
The following pages link to On finding robust approximate inverses for large sparse matrices (Q2929473):
Displaying 24 items.
- Finding generalized inverses by a fast and efficient numerical method (Q482683) (← links)
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies (Q491139) (← links)
- Computing outer inverses by scaled matrix iterations (Q898934) (← links)
- Local inversion of matrices with sparse inverses (Q1307520) (← links)
- Construction of a convergent scheme for finding matrix sign function (Q1643060) (← links)
- An efficient computation of generalized inverse of a matrix (Q1740439) (← links)
- Factorizations of hyperpower family of iterative methods via least squares approach (Q1993608) (← links)
- A survey on the high convergence orders and computational convergence orders of sequences (Q2008170) (← links)
- Hyperpower least squares progressive iterative approximation (Q2104064) (← links)
- Exploiting higher computational efficiency index for computing outer generalized inverses (Q2120789) (← links)
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse (Q2132907) (← links)
- An efficient matrix iteration family for finding the generalized outer inverse (Q2148067) (← links)
- Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach (Q2217423) (← links)
- An efficient matrix iterative method for computing Moore-Penrose inverse (Q2223078) (← links)
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications (Q2247163) (← links)
- A class of Kung-Traub-type iterative algorithms for matrix inversion (Q2323899) (← links)
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\) (Q2331707) (← links)
- Finding the Moore-Penrose inverse by a new matrix iteration (Q2354185) (← links)
- Constructing two-step iterative methods with and without memory (Q2354433) (← links)
- Approximation of the determinant of large sparse symmetric positive definite matrices (Q2784380) (← links)
- (Q4383439) (← links)
- (Q4940814) (← links)
- A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors (Q5080089) (← 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)
