Local and parallel finite element algorithms based on two-grid discretizations (Q4955853)

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 1449974
Language Label Description Also known as
default for all languages
No label defined
    English
    Local and parallel finite element algorithms based on two-grid discretizations
    scientific article; zbMATH DE number 1449974

      Statements

      Local and parallel finite element algorithms based on two-grid discretizations (English)
      0 references
      0 references
      0 references
      22 May 2000
      0 references
      finite element methods
      0 references
      two-grid discretizations
      0 references
      elliptic problems
      0 references
      error estimates
      0 references
      multigrid method
      0 references
      parallel computation
      0 references
      numerical experiments
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      The authors consider a convex polygonal domain \(\Omega\subset \mathbb{R}^2\) and the elliptic model equation \(-\Delta u+ b\cdot \nabla u= f\) in \(\Omega\) under the boundary condition \(u= 0\) on \(\partial\Omega\). It is supposed that a coarse grid approximation is good enough to capture the global component of the solution. Then the authors suggest to improve it on much finer grids in subdomains by some local and parallel procedure. The mathematical justification of such methods is connected with the interesting a priori inequality \[ \|u- P_h u\|_{1,D}\leq K\{h^s_{\Omega_0}\|u\|_{s+1,\Omega_0}+ h^{s+ \alpha}_\Omega\|u\|_{s+1,\Omega}\}, \] where \(D\subset\subset \Omega_0\subset\subset \Omega\), \(h_{\Omega_0}\) corresponds to the fine grid on \(\overline\Omega_0\), and \(h_\Omega\) to the original coarse grid on \(\overline\Omega\). Numerical experiments with \(h\asymp 10^{-3}\) in the unit square confirm good perspectives of such methods. Adaptation of grids is discussed as well.
      0 references

      Identifiers

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