Multilevel Spectral Domain Decomposition

  title={Multilevel Spectral Domain Decomposition},
  author={Peter Bastian and Robert Scheichl and Linus Seelinger and Arne Strehlow},
Highly heterogeneous, anisotropic coefficients, e.g. in the simulation of carbon-fibre composite components, can lead to extremely challenging finite element systems. Direct solvers for the resulting large and sparse linear systems suffer from severe memory requirements and limited parallel scalability, while iterative solvers in general lack robustness. Two-level spectral domain decomposition methods can provide such robustness for symmetric positive definite linear systems, by using coarse… 

Figures and Tables from this paper

A fully algebraic and robust two-level Schwarz method based on optimal local approximation spaces

A novel algebraic adaptive coarse space, which relies on the a -orthogonal decomposition of (local) finite element (FE) spaces into functions that solve the partial dif-ferential equation (PDE) with some trace and FE functions that are zero on the boundary, is proposed.

Overlapping Schwarz methods with GenEO coarse spaces for indefinite and non-self-adjoint problems

An iterative solver which is efficient in parallel and very effective for a wide range of convection–diffusion– reaction problems, and whose discretisations are solved with preconditioned GMRES.

Efficient Algebraic Two-Level Schwarz Preconditioner For Sparse Matrices

A new spectral coarse space that can be constructed in a fully-algebraic way unlike most existing spectral coarse spaces is presented and theoretical convergence result for Hermitian positive definite diagonally dominant matrices is presented.

Scalable multiscale-spectral GFEM for composite aero-structures

By allowing low-cost approximate solves for closely related models or geometries this e-cient, novel technology provides the basis for future applications in optimisation or uncertainty quantification on challenging problems in composite aero-structures.



Domain decomposition for multiscale PDEs

Estimates prove very precisely the previously made empirical observation that the use of low-energy coarse spaces can lead to robust preconditioners that are robust even for large coefficient variation inside domains when the classical method fails to be robust.

Robust Domain Decomposition Preconditioners for Abstract Symmetric Positive Definite Bilinear Forms

An abstract framework for constructing stable decompositions of the spaces corresponding to general symmetric positive definite problems into "local" subspaces and a global "coarse" space is developed and the constant in the corresponding abstract energy estimate is shown to be robust with respect to mesh parameters as well as the contrast.

A Multilevel Schwarz Preconditioner Based on a Hierarchy of Robust Coarse Spaces

A robust multilevel additive Schwarz preconditioner where at each level the condition number is bounded, ensuring a fast convergence for each nested solver.

Multilevel Methods for Elliptic Problems with Highly Varying Coefficients on Nonaligned Coarse Grids

The theoretical results provide a recipe for designing hierarchies of standard piecewise linear coarse spaces such that the multigrid convergence rate and the condition number of the Schwarz preconditioned system do not depend on the coefficient variation or on any mesh parameters.

Analysis of a Two-level Schwarz Method with Coarse Spaces Based on Local Dirichlet-to-Neumann Maps

This work presents a rigorous analysis of a two-level overlapping additive Schwarz method, which provides an automatic criterion for the number of modes that need to be added per subdomain to obtain a convergence rate of the order of the constant coefficient case.

Domain Decomposition Preconditioners for Multiscale Flows in High-Contrast Media

This paper introduces an eigenvalue problem that automatically detects high-conductivity regions via a large gap in the spectrum and develops domain decomposition preconditioners with the condition number that is independent of the contrast when there are variations within coarse regions.

Efficient domain decomposition methods for elliptic problems arising from flows in heterogeneous porous media

This paper proposes the use of a multiscale coarse solver based on a finite volume – finite element formulation and demonstrates the efficiency and robustness of the preconditioner through numerical experiments which include problems with multiple scale coefficients, as well as problems with continuous scales.

An introduction to domain decomposition methods - algorithms, theory, and parallel implementation

The authors present all popular algorithms, both at the PDE level and at the discrete level in terms of matrices, along with systematic scripts for sequential implementation in a free open-source finite element package as well as some parallel scripts.

Iterative Methods by Space Decomposition and Subspace Correction

A unified theory for a diverse group of iterative algorithms, such as Jacobi and Gauss–Seidel iterations, diagonal preconditioning, domain decomposition methods, multigrid methods,Multilevel nodal basis preconditionsers and hierarchical basis methods, is presented by using the notions of space decomposition and subspace correction.