Efficient domain decomposition preconditioning for the hierarchical \(p\)-version. II (Q1589128)

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 1541546
Language Label Description Also known as
default for all languages
No label defined
    English
    Efficient domain decomposition preconditioning for the hierarchical \(p\)-version. II
    scientific article; zbMATH DE number 1541546

      Statements

      Efficient domain decomposition preconditioning for the hierarchical \(p\)-version. II (English)
      0 references
      0 references
      30 October 2001
      0 references
      This article is a continuation of part I [ibid. 43, No. 5, 35-52 (1999; Zbl 0983.65132)]. From the introduction: As soon as the domain decomposition preconditioner is defined, it can be used in any iterative procedure for the solution of the finite element system such as the preconditioned conjugate gradient, simple iteration, and other methods. In any of them we do not use the preconditioner itself, but the sequence of operations equivalent to the multiplication by the inverse to the preconditioner. Thus we need only to define the inverses to our preconditioners. We do this in Sections 5 and 6.
      0 references
      conjugate gradient method
      0 references
      preconditioning
      0 references
      \(p\)-version
      0 references
      domain decomposition
      0 references
      finite element
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references