A simple algorithm for computing the generalized inverse of a matrix

DOI10.1145/355592.365659MaRDI QIDQ5508625zbMATH OpenOpenAlexWikidataFDO

Authors Bert W. Rust, W. R. Burrus, C. Schneeberger

Publication date 1966

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355592.365659

zbMATH Keywords

numerical analysis

Cited in

(13)

• Once again: The least square problem
• Computational methods of linear algebra
• A variable metric method for approximating generalized inverses of matrices
• Fault-tolerant database using distributed associative memories
• A conjecture of Frobenius and the simple groups of Lie type. I
• On the approximation of nonlinear oscillations
• A direct method for the general solution of a system of linear equations
• On two direct methods for computing generalized inverses
• Numerical algorithms for the Moore-Penrose inverse of a matrix: direct methods
• Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
• Special issue: GAMM 2000. Annual meeting. Short communications in mathematics and mechanics, section 9-25. Univ. of Göttingen, Germany, April 2--7, 2000
• An alternative proof for the recursive formulae for computing the Moore--Penrose M-inverse of a matrix
• Computational aspects of matrix generalized inversion for the computer with applications

This page was built for publication: A simple algorithm for computing the generalized inverse of a matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5508625)