A Note on an Iterative Method for Generalized Inversion of Matrices
From MaRDI portal
Publication:5517198
DOI10.2307/2003604zbMath0142.11603OpenAlexW4245496342MaRDI QIDQ5517198
Publication date: 1966
Full work available at URL: https://doi.org/10.2307/2003604
Related Items
An efficient hyperpower iterative method for computing weighted Moore-Penrose inverse, On the computation of weighted Moore-Penrose inverse using a high-order matrix method, The hyperpower iteration revisited, Iterative inversion of structured matrices, Calculating the Best Approximate Solution of an Operator Equation, A self-correcting matrix iteration for the Moore-Penrose generalized inverse, Iterative method for computing the Moore-Penrose inverse based on Penrose equations, Computing outer inverses by scaled matrix iterations, Homotopic residual correction processes, A General Algorithm to Calculate the Inverse Principal p-th Root of Symmetric Positive Definite Matrices, Efficient parallel factorization and solution of structured and unstructured linear systems, Newton-like iteration based on a cubic polynomial for structured matrices, Lösung überbestimmter linearer Gleichungssysteme im Sinne einer energetischen Norm, A geometrical approach on generalized inverses by Neumann-type series, Neumann-type expansion of reflexive generalized inverses of a matrix and the hyperpower iterative method, Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix, On computing the best least squares solutions in Hilbert space, The generalized inverse of a sum with radical element: Applications, A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis, Fast and efficient parallel solution of dense linear systems, Concise row-pruning algorithm to invert a matrix, Stabilized BFGS approximate Kalman filter
Cites Work
