Kiełbasiński, A. Iterative refinement of least squares solutions computed from normal equations. (Polish. English summary) Zbl 0701.65028 Ann. Soc. Math. Pol., Ser. III, Mat. Stosow. 31, 91-101 (1989). Let A be an \(m\times n\) matrix, rank \(A=n\), \(n<m\). The author presents an analysis of rounding errors in the solution of the regular linear least squares problem Ax\(\cong b\) using Cholesky decomposition of the normal equation and compares this algorithm with that of Golub-Householder. Then it is shown that the iterative refinement of the solution which uses the standard floating point arithmetics yields almost full accuracy of the computed solution provided a condition of the form \(\nu mn\kappa^ 2<1\) is fulfilled, where \(\kappa =| A| \cdot | A^+|\), \(A^+=(A^ TA)^{-1}A^ T\). Reviewer: Z.Dostal MSC: 65F20 Numerical solutions to overdetermined systems, pseudoinverses 65G50 Roundoff error Keywords:rounding errors; regular linear least squares; Cholesky decomposition; normal equation; iterative refinement PDFBibTeX XMLCite \textit{A. Kiełbasiński}, Ann. Soc. Math. Pol., Ser. III, Mat. Stosow. 31, 91--101 (1989; Zbl 0701.65028)