No label defined (Q3974785)

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 17465
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 17465

      Statements

      0 references
      26 June 1992
      0 references
      \(QR\) algorithm
      0 references
      \(LR\) algorithm
      0 references
      \(GR\) algorithm
      0 references
      convergence
      0 references
      generic chasing algorithm
      0 references
      subspace iterations
      0 references
      \(QR\) decomposition
      0 references
      [For the entire collection see Zbl 0728.00018.] A general theory of \(GR\) algorithms which subsumes the theory of \(QR\) and \(LR\) algorithms is described, and its convergence properties are discussed. The \(GR\)-algorithm is defined generally. It allows multiple \(GR\) step of any multiplicity. Every \(GR\) algorithm is a form of subspace iteration in which a change of coordinate system is made at each step. A generic chasing algorithm is described and shows that its implicity performs a generic \(QR\) step. The convergence of all \(GR\) algorithms is based on the convergence of subspace iterations. The generic \(GR\) algorithm is based on a generic \(QR\) decomposition whose \(Q\) is nonsingular and \(R\) is upper triangular.
      0 references

      Identifiers