Domain decomposition multigrid for unstructured grids
A two-level preconditioning method for the solution of elliptic boundary value problems using finite element schemes on possibly unstructured meshes is introduced. It is based on a domain decomposition and a Galerkin scheme for the coarse level vertex unknowns. For both the implementation and the analysis, it is not required that the curves of discontinuity in the coefficients of the PDE match the interfaces between subdomains. Generalizations to nonmatching or overlapping grids are made.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE Assistant Secretary for Human Resources and Administration, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 420366
- Report Number(s):
- LA-UR-96-3702; ON: DE97002314; TRN: 97:000766
- Resource Relation:
- Other Information: PBD: [1997]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Domain decomposition method for nonconforming finite element approximations of anisotropic elliptic problems on nonmatching grids
An improved convergence bound for aggregation-based domain decomposition preconditioners.
Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods
Conference
·
Tue Dec 31 00:00:00 EST 1996
·
OSTI ID:420366
An improved convergence bound for aggregation-based domain decomposition preconditioners.
Journal Article
·
Wed Jun 01 00:00:00 EDT 2005
· Proposed for publication in the SIAM Journal on Matrix Analysis and Applications.
·
OSTI ID:420366
Unified Geometric Multigrid Algorithm for Hybridized High-Order Finite Element Methods
Journal Article
·
Tue Oct 29 00:00:00 EDT 2019
· SIAM Journal on Scientific Computing
·
OSTI ID:420366