Adaptive coefficients iterative method for computing matrix inverse
From MaRDI portal
Cites work
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- An efficient matrix iteration family for finding the generalized outer inverse
- Generalised matrix inversion and rank computation by successive matrix powering
- Generalized inverses. Theory and applications.
- Generalized Schultz iterative methods for the computation of outer inverses
- 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
- Higher-order convergent iterative method for computing the generalized inverse and its application to Toeplitz matrices
- Hyper-power methods for the computation of outer inverses
- Hyperpower least squares progressive iterative approximation
- Iterative Berechnung der reziproken Matrix.
- Modified bas iteration method for absolute value equation
- Schultz matrix iteration based method for stable solution of discrete ill-posed problems
- Successive matrix squaring algorithm for computing the Drazin inverse
- Two-parameters numerical methods of the non-symmetric algebraic Riccati equation
This page was built for publication: Adaptive coefficients iterative method for computing matrix inverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883485)
