Partitioned multiply scaled pseudo conjugate gradient schemes (Q1185504)

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 38546
Language Label Description Also known as
default for all languages
No label defined
    English
    Partitioned multiply scaled pseudo conjugate gradient schemes
    scientific article; zbMATH DE number 38546

      Statements

      Partitioned multiply scaled pseudo conjugate gradient schemes (English)
      0 references
      0 references
      28 June 1992
      0 references
      The authors consider the system of linear algebraic equations \(Ax=b\) with a symmetric positive definite matrix \(A\). They suppose that the matrix \(A\) has a block form with \(p\) diagonal square blocks. The authors develop the classical algorithm of the conjugate gradients, where in every step two parameters are calculated in the sense that two diagonal matrices, which is analogous to the two parameters in the classical case, are calculated in each step. These block diagonal matrices have the same block form as the matrix \(A\). Numerical tests for the heat conduction problem are presented for preconditioned and nonpreconditioned versions and various partitions of the matrix \(A\).
      0 references
      preconditioning
      0 references
      matrix partitions
      0 references
      scaling
      0 references
      optimal local search direction
      0 references
      symmetric positive definite matrix
      0 references
      conjugate gradients
      0 references
      block diagonal matrices
      0 references
      0 references

      Identifiers