scientific article; zbMATH DE number 3844929

From MaRDI portal
Publication:3314859





[For the entire collection see Zbl 0504.00026.] The use of normal equations and Givens rotation for solving sparse least squares problems are discussed. The first-algorithm is based on the use of Gaussian elimination with complete pivoting. The authors review both the algorithms and provide a fairly good sample of computational results. Based on these numerical experiments they conclude that the first algorithm should be used when the observation matrix is sparse and numerical stability is unimportant. The second algorithm, which is based on Givens rotation, is preferable if numerical stability is major issue.











This page was built for publication:

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