A note on computational algorithm for the inverse of a square matrix
The author presents in this short note some improvements of an error estimate for an iterative algorithm which approximates the inverse of a square nonsingular matrix. Reviewer's remark: The algorithm considered in this note (and also in its reference [1]) was first proposed many years ago by \textit{G. Schulz} [Z. f. angew. Math. 13, 57--59 (1933; JFM 59.0535.04)] and then developed by \textit{A. Ben-Israel} in several papers for the more general case of the Moore-Penrose pseudoinverse of a matrix [see e.g., Math. Comput. 19, 452--455 (1965; Zbl 0136.12703)]. Thus, some comments on that together with the citation of the above mentioned paper should have been considered in the note.
scientific article; zbMATH DE number 5163774