A Note on an Iterative Method for Generalized Inversion of Matrices
From MaRDI portal
Cites work
Cited in
(22)- Stabilized BFGS approximate Kalman filter
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- Iterative inversion of structured matrices
- Fast and efficient parallel solution of dense linear systems
- On the computation of weighted Moore-Penrose inverse using a high-order matrix method
- On computing the best least squares solutions in Hilbert space
- The hyperpower iteration revisited
- Newton-like iteration based on a cubic polynomial for structured matrices
- The generalized inverse of a sum with radical element: Applications
- Concise row-pruning algorithm to invert a matrix
- Computing outer inverses by scaled matrix iterations
- An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse
- Neumann-type expansion of reflexive generalized inverses of a matrix and the hyperpower iterative method
- Homotopic residual correction processes
- A geometrical approach on generalized inverses by Neumann-type series
- A self-correcting matrix iteration for the Moore-Penrose generalized inverse
- Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
- Calculating the Best Approximate Solution of an Operator Equation
- A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis
- Lösung überbestimmter linearer Gleichungssysteme im Sinne einer energetischen Norm
- A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices
This page was built for publication: A Note on an Iterative Method for Generalized Inversion of Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5517198)
