Pages that link to "Item:Q4103423"
From MaRDI portal
The following pages link to Optimal iterative schemes for computing the Moore-Penrose matrix inverse (Q4103423):
Displaying 16 items.
- An efficient matrix iteration for computing weighted Moore-Penrose inverse (Q505776) (← links)
- Solving linear program as linear system in polynomial time (Q552124) (← links)
- Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights (Q946708) (← links)
- Concise row-pruning algorithm to invert a matrix (Q1320118) (← links)
- Solving linear programming problems exactly (Q1354256) (← links)
- \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation. (Q1569192) (← links)
- A matrix iteration for finding Drazin inverse with ninth-order convergence (Q1722157) (← links)
- An improved computationally efficient method for finding the Drazin inverse (Q1727190) (← links)
- An efficient computation of generalized inverse of a matrix (Q1740439) (← links)
- A direct heuristic algorithm for linear programming (Q1971659) (← links)
- Factorizations of hyperpower family of iterative methods via least squares approach (Q1993608) (← links)
- Hyperpower least squares progressive iterative approximation (Q2104064) (← links)
- Exploiting higher computational efficiency index for computing outer generalized inverses (Q2120789) (← links)
- Further efficient hyperpower iterative methods for the computation of generalized inverses \(A_{T,S}^{(2)}\) (Q2331707) (← links)
- A note on the stability of a \(p\)th order iteration for finding generalized inverses (Q2345288) (← links)
- Chemical equation balancing: an integer programming approach (Q2476121) (← links)
