Asymptotically optimal row-action methods for generalized least squares problems

From MaRDI portal





A study of asymptotically optimal behavior of row-iteration methods for solving very large sparse generalized least squares systems of linear equations is given. Row-iteration methods are characterized by the following properties: No changes are made to the original coefficient matrix, no operations are performed on the matrix as a whole, and only one row is used in each iterative step. The authors propose some asymptotically optimal row-iteration methods and several numerical algorithms for the generalized least squares problem. No results of computational experiments are given.











This page was built for publication: Asymptotically optimal row-action methods for generalized least squares problems

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