Convergence rate estimate for a domain decomposition method (Q803761)

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 4201554
Language Label Description Also known as
default for all languages
No label defined
    English
    Convergence rate estimate for a domain decomposition method
    scientific article; zbMATH DE number 4201554

      Statements

      Convergence rate estimate for a domain decomposition method (English)
      0 references
      0 references
      0 references
      0 references
      1991
      0 references
      We provide a convergence rate analysis for a variant of the domain decomposition method introduced by the second and the third author for solving the algebraic equations that arise from finite element discretization of nonsymmetric and indefinite elliptic problems with Dirichlet boundary conditions in \({\mathbb{R}}^ 2\). We show that the convergence rate of the preconditioned GMRES method is nearly optimal in the sense that the rate of convergence depends only logarithmically on the mesh size and the number of substructures, if the global coarse mesh is fine enough.
      0 references
      substructuring
      0 references
      iterative method
      0 references
      convergence rate
      0 references
      domain decomposition method
      0 references
      finite element
      0 references
      nonsymmetric and indefinite elliptic problems
      0 references
      preconditioned GMRES method
      0 references

      Identifiers

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