On Iterative Computation of Generalized Inverses and Associated Projections

From MaRDI portal
Publication:5519486

DOI10.1137/0703035zbMath0143.37402OpenAlexW2048134878WikidataQ56227097 ScholiaQ56227097MaRDI QIDQ5519486

Adi Ben-Israel, Dan Cohen

Publication date: 1966

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/709f3102347a44748a7bbcbe4b1273b07dc71661



Related Items

Approximate Inverse Preconditioners for the Conjugate Gradient Method, Computer-Aided Verification for Iterative Matrix Inversion Problems in Systems and Control, The hyperpower iteration revisited, A new scheme of computing the approximate inverse preconditioner for the reduced linear systems, Targetted stochastic matrix inversion, A Note on an Iterative Method for Generalized Inversion of 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, On the convergence of an iterative method for the computation of generalized inverse and associated projections †, Computing outer inverses by scaled matrix iterations, Computational methods of linear algebra, A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse, A Variable Metric Method for Approximating Generalized Inverses of Matrices, A Variable Metric Method for Approximating Generalized Inverses of Matrices, Application of a generalized Sherman–Morrison formula to the computation of network Green's functions and the construction of spanning trees, Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights, An efficient method to compute the Moore-Penrose inverse, Simplified CSP analysis of a stiff stochastic ODE system, Efficient parallel factorization and solution of structured and unstructured linear systems, An improved algorithm for basis pursuit problem and its applications, Newton-like iteration based on a cubic polynomial for structured matrices, Numerical algorithms for the Moore-Penrose inverse of a matrix: iterative methods, 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, Iterative methods for computing generalized inverses related with optimization methods, Approximation of matrices and a family of Gander methods for polar decomposition, Chebyshev-type methods and preconditioning techniques, Schultz matrix iteration based method for stable solution of discrete ill-posed problems, Superfast solution of linear convolutional Volterra equations using QTT approximation, On the matrix equation \(Ax =\lambda Bx\), LU factorization of non-standard forms and direct multiresolution solvers, An efficient quadratically convergent iterative method to find the Moore–Penrose inverse, On generalized inverses and on the uniform convergence of \((I-\beta K)_ n\) with application to iterative methods, A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis, Fast and efficient parallel solution of dense linear systems, A class of Kung-Traub-type iterative algorithms for matrix inversion, Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers, Iterative methods with different rates of convergence for calculating weighted pseudoinverse matrices and weighted normal pseudosolutions with positive definite weights, A comparison of Jacobian-based methods of inverse kinematics for serial robot manipulators