Parallel iterative domain decomposition method for elliptic equation - many subdomains case (Q1201633)

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 98068
Language Label Description Also known as
default for all languages
No label defined
    English
    Parallel iterative domain decomposition method for elliptic equation - many subdomains case
    scientific article; zbMATH DE number 98068

      Statements

      Parallel iterative domain decomposition method for elliptic equation - many subdomains case (English)
      0 references
      0 references
      0 references
      17 January 1993
      0 references
      The paper deals with a parallel domain decomposition method with many subregions and cross points for solving elliptic equations. The authors present an algorithm in which at each cross point a subregion is selected to cover it, but the covering subdomains of different cross points do not intersect each other. After having proved some lemmas the authors formulate and prove a theorem on convergence of the method discussed. A numerical example for the homogeneous Dirichlet boundary value problem of the Poisson equation is presented.
      0 references
      parallel computation
      0 references
      iterative method
      0 references
      domain decomposition
      0 references
      elliptic equations
      0 references
      convergence
      0 references
      numerical example
      0 references
      Dirichlet boundary value problem
      0 references
      Poisson equation
      0 references

      Identifiers

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