Pages that link to "Item:Q2842361"
From MaRDI portal
The following pages link to On a fast iterative method for approximate inverse of matrices (Q2842361):
Displaying 31 items.
- Finding generalized inverses by a fast and efficient numerical method (Q482683) (← links)
- Geometrical inverse preconditioning for symmetric positive definite matrices (Q515461) (← links)
- A rapid numerical algorithm to compute matrix inversion (Q715101) (← 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)
- Fast computation of some asymptotic functional inverses (Q1333160) (← links)
- On the extension of Householder's method for weighted Moore-Penrose inverse (Q1644552) (← links)
- Fast calculation of Laurent expansions for matrix inverses (Q1674697) (← links)
- Comparison of linear solvers for equilibrium geochemistry computations (Q1702340) (← links)
- Solving nondifferentiable nonlinear equations by new Steffensen-type iterative methods with memory (Q1719158) (← 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)
- A general class of arbitrary order iterative methods for computing generalized inverses (Q2244155) (← links)
- A class of Kung-Traub-type iterative algorithms for matrix inversion (Q2323899) (← links)
- Finding the Moore-Penrose inverse by a new matrix iteration (Q2354185) (← links)
- Weighting Shepard-type operators (Q2398134) (← links)
- Stable time step estimates for NURBS-based explicit dynamics (Q2631462) (← links)
- A comparison of the implicit determinant method and inverse iteration (Q2801097) (← links)
- An approach to the approximation of the inverse of a square matrix by He's homotopy perturbation method (Q2890654) (← links)
- Construction and investigation of non-stationary iteration methods of solving systems of linear equations and inverse of matrices (Q2896757) (← links)
- On finding robust approximate inverses for large sparse matrices (Q2929473) (← links)
- (Q3189157) (← links)
- Nachiteration durch elementare Transformationsdurchführung (Q3468527) (← links)
- (Q3481166) (← links)
- On the Convergence of the Higher Order Versions of D. J. Evans' Implicit Matrix Inversion Process (Q3677051) (← links)
- Fast O(n) complexity algorithms for diagonal innovation matrices (Q3698157) (← links)
- Approximate Inverse Techniques for Block-Partitioned Matrices (Q4376253) (← links)
- (Q4513112) (← links)
- A Space Efficient Flexible Pivot Selection Approach to Evaluate Determinant and Inverse of a Matrix (Q4554864) (← links)
- Iterative refinement of computing inverse matrix (Q5190718) (← links)
- A fast convergent iterative solver for approximate inverse of matrices (Q5502422) (← 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)