A High-Performance Implementation of a Robust Preconditioner for Heterogeneous Problems

  title={A High-Performance Implementation of a Robust Preconditioner for Heterogeneous Problems},
  author={Linus Seelinger and Anne Reinarz and Robert Scheichl},
We present an efficient implementation of the highly robust and scalable GenEO preconditioner in the high-performance PDE framework DUNE. The GenEO coarse space is constructed by combining low energy solutions of a local generalised eigenproblem using a partition of unity. In this paper we demonstrate both weak and strong scaling for the GenEO solver on over 15,000 cores by solving an industrially motivated problem with over 200 million degrees of freedom. Further, we show that for highly… 



Scalable domain decomposition preconditioners for heterogeneous elliptic problems

A lightweight implementation of a theoretically and numerically scalable preconditioner is presented in the context of overlapping methods, and it will be shown how this work can be applied to a variety of other methods, such as non-overlapping methods and abstract deflation based preconditionsers.

Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps

This work introduces in a variational setting a new coarse space that is robust even when there are such heterogeneities in the PDE coefficients, by solving local generalized eigenvalue problems in the overlaps of subdomains that isolate the terms responsible for slow convergence.

On the generic parallelisation of iterative solvers for the finite element method

An abstract parallelisation approach is presented which clearly separates the parallelisation aspects from the data structures and solver algorithms by imposing an abstract consistency model onto the building blocks of the iterative solver components.

Generic implementation of finite element methods in the Distributed and Unified Numerics Environment (DUNE)

PDELAB considerably simplifies the implementation of discretization schemes for systems of partial differential equations by setting up global functions and operators from a simple element-local description.


This theoretical study explores how to automate the selection of weights and primal constraints in BDDC methods for general SPD problems and gives a localized algorithm which guarantees the definiteness of the matrix r S underlying the BDDC preconditioner under mild assumptions on the subdomain matrices.

A generic grid interface for parallel and adaptive scientific computing. Part II: implementation and tests in DUNE

An efficient interface specification as a set of C++ classes is derived that separates the applications from the grid data structures and thus, user implementations become independent of the underlying grid implementation.

Domain decomposition methods : algorithms and theory

The purpose of this text is to offer a comprehensive and self-contained presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element