An iterative method for computing generalized inverses

DOI10.1080/00207167108803052MaRDI QIDQ5634784zbMATH OpenOpenAlexFDO

Authors R. P. Tewarson

Publication date 1971

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207167108803052

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Cites work

• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3248502 (Why is no real title available?)
• scientific article; zbMATH DE number 3269388 (Why is no real title available?)
• An optimum cubically convergent iterative method of inverting a linear bounded operator in Hilbert space
• On the Chebyshev solution of inconsistent linear equations
• Some comments on the solution of linear equations
• Two Algorithms Related to the Method of Steepest Descent

Cited in

(6)

• Computational methods of linear algebra
• A variable metric method for approximating generalized inverses of matrices
• 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 initial value method for solving Fredholm integral equation of the first kind
• Diagonalization, rank calculation and generalized inverses of rational matrices

This page was built for publication: An iterative method for computing generalized inverses

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