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

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)

Review text

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.

Recommendations

Cites work

Cited in

(only showing first 100 items - show all)

This page was built for publication: Local and parallel finite element algorithms based on two-grid discretizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955853)