A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight (Q808624)

From MaRDI portal





scientific article; zbMATH DE number 4211378
Language Label Description Also known as
default for all languages
No label defined
    English
    A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight
    scientific article; zbMATH DE number 4211378

      Statements

      A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight (English)
      0 references
      0 references
      0 references
      1990
      0 references
      The authors investigate a class of algorithms for solving a least squares problem with some weight. The presented CR-WLS(k) algorithm is a generalization of the Orthomin(k)-method of conjugate residual type for the linear least squares problem. This generalization is given by an incorporation of some mapping matrix (denoted by B) into the formulas of the Orthomin(k) method. Necessary and sufficient conditions for the convergence of the CR-WLS(k) algorithm are given and some choices of B are discussed so that the convergence conditions are fulfilled.
      0 references
      conjugate direction
      0 references
      least squares problem
      0 references
      CR-WLS(k) algorithm
      0 references
      Orthomin(k)-method
      0 references
      convergence
      0 references

      Identifiers