Asymptotically optimal row-action methods for generalized least squares problems (Q4256045)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1308999
Language Label Description Also known as
default for all languages
No label defined
    English
    Asymptotically optimal row-action methods for generalized least squares problems
    scientific article; zbMATH DE number 1308999

      Statements

      Asymptotically optimal row-action methods for generalized least squares problems (English)
      0 references
      0 references
      0 references
      14 February 2000
      0 references
      generalized least squares
      0 references
      sparse matrices
      0 references
      row-iteration methods
      0 references
      numerical algorithms
      0 references
      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.
      0 references

      Identifiers