Pages that link to "Item:Q2364221"
From MaRDI portal
The following pages link to Generalized Schultz iterative methods for the computation of outer inverses (Q2364221):
Displaying 20 items.
- Hyper-power methods for the computation of outer inverses (Q475650) (← links)
- Rapid generalized Schultz iterative methods for the computation of outer inverses (Q724547) (← links)
- A higher order iterative method for \(A^{(2)}_{T,S}\) (Q741388) (← links)
- Computing outer inverses by scaled matrix iterations (Q898934) (← links)
- An iterative method for solving general restricted linear equations (Q1663422) (← links)
- A family of iterative methods with accelerated convergence for restricted linear system of equations (Q1693361) (← links)
- On the perturbation of outer inverses of linear operators in Banach spaces (Q1790499) (← links)
- An efficient class of iterative methods for computing generalized outer inverse \({M_{T,S}^{(2)}}\) (Q2053113) (← links)
- Error bounds in the computation of outer inverses with generalized schultz iterative methods and its use in computing of Moore-Penrose inverse (Q2101945) (← links)
- Hyperpower least squares progressive iterative approximation (Q2104064) (← links)
- Exploiting higher computational efficiency index for computing outer generalized inverses (Q2120789) (← links)
- Modified bas iteration method for absolute value equation (Q2129762) (← links)
- An efficient matrix iteration family for finding the generalized outer inverse (Q2148067) (← links)
- Enclosing Moore-Penrose inverses (Q2174195) (← links)
- A general class of arbitrary order iterative methods for computing generalized inverses (Q2244155) (← links)
- Exact solutions and convergence of gradient based dynamical systems for computing outer inverses (Q2246062) (← links)
- A class of quadratically convergent iterative methods (Q2331694) (← links)
- A two-step iterative method and its acceleration for outer inverses (Q2360126) (← links)
- Successive matrix squaring algorithm for computing outer inverses (Q2518685) (← 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)
