Markus Blatt
Markus Blatt has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Peter Bastian
Interdisziplinäres Zentrum für Wissenschaftliches Rechnen Ruprechts-Karls-Universität Heidelberg Im Neuenheimer Feld 368 D-69120 Heidelberg Germany
2 shared publicationsOlaf Ippisch
Interdisziplinäres Zentrum für Wissenschaftliches Rechnen Ruprechts-Karls-Universität Heidelberg Im Neuenheimer Feld 368 D-69120 Heidelberg Germany
1 shared publication- Robert Scheichl
University of Heidelberg
1 shared publication
Latest Publications
- Open Access
A Massively Parallel Algebraic Multigrid Preconditioner based on Aggregation for Elliptic Problems with Heterogeneous Coefficients
This paper describes a massively parallel algebraic multigrid method based on non-smoothed aggregation. It is especially suited for solving heterogeneous elliptic problems as it uses a greedy heuristic algorithm for the aggregation that detects changes in the coefficients and prevents aggregation across them. Using decoupled aggregation on each process with data agglomeration onto fewer processes on the coarse level, it weakly scales well in terms of both total time to solution and time per iteration to nearly 300,000 cores. Because of simple piecewise constant interpolation between the levels, its memory consumption is low and allows solving problems with more than 100,000,000,000 degrees of freedom.
Open AccessA Massively Parallel Algebraic Multigrid Preconditioner based on Aggregation for Elliptic Problems with Heterogeneous Coefficients
This paper describes a massively parallel algebraic multigrid method based on non-smoothed aggregation. It is especially suited for solving heterogeneous elliptic problems as it uses a greedy heuristic algorithm for the aggregation that detects changes in the coefficients and prevents aggregation across them. Using decoupled aggregation on each process with data agglomeration onto fewer processes on the coarse level, it weakly scales well in terms of both total time to solution and time per iteration to nearly 300,000 cores. Because of simple piecewise constant interpolation between the levels, its memory consumption is low and allows solving problems with more than 100,000,000,000 degrees of freedom.
- Open Access
DUNE as an Example of Sustainable Open Source Scientific Software Development
In this paper we describe how DUNE, an open source scientific software framework, is developed. Having a sustainable software framework for the solution of partial differential equations is the main driver of DUNE's development. We take a look how DUNE strives to stay sustainable software.
Open AccessDUNE as an Example of Sustainable Open Source Scientific Software Development
In this paper we describe how DUNE, an open source scientific software framework, is developed. Having a sustainable software framework for the solution of partial differential equations is the main driver of DUNE's development. We take a look how DUNE strives to stay sustainable software.
- 1 February 2012
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 19 (2) , 367-388
Algebraic multigrid for discontinuous Galerkin discretizations of heterogeneous elliptic problems
SUMMARY: We present a new algebraic multigrid (AMG) algorithm for the solution of linear systems arising from discontinuous Galerkin (DG) discretizations of heterogeneous elliptic problems. The algorithm is based on the idea of subspace corrections, and the first coarse level space is the subspace spanned by continuous linear basis functions. The linear system associated with this space is constructed algebraically using a Galerkin approach with the natural embedding as the prolongation operator. This embedding operator needs to be provided, which means that the approach is not fully algebraic. For the construction of the linear systems on the subsequent coarser levels, non‐smoothed aggregation AMG techniques are used. In a series of numerical experiments, we establish for the first time the efficiency and robustness of an AMG method for various symmetric and non‐symmetric interior penalty DG methods (including the higher‐order cases) on problems with complicated, high contrast jumps in the coefficients. The solver is robust with respect to an increase in the polynomial degree of the DG approximation space (at least up to degree 6), computationally efficient, and affected only mildly by the coefficient jumps and by the mesh size h (i.e., number of iterations = O(log h−1)). Copyright © 2012 John Wiley & Sons, Ltd.
- 1 February 2012
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 19 (2) , 367-388
Algebraic multigrid for discontinuous Galerkin discretizations of heterogeneous elliptic problems
SUMMARY: We present a new algebraic multigrid (AMG) algorithm for the solution of linear systems arising from discontinuous Galerkin (DG) discretizations of heterogeneous elliptic problems. The algorithm is based on the idea of subspace corrections, and the first coarse level space is the subspace spanned by continuous linear basis functions. The linear system associated with this space is constructed algebraically using a Galerkin approach with the natural embedding as the prolongation operator. This embedding operator needs to be provided, which means that the approach is not fully algebraic. For the construction of the linear systems on the subsequent coarser levels, non‐smoothed aggregation AMG techniques are used. In a series of numerical experiments, we establish for the first time the efficiency and robustness of an AMG method for various symmetric and non‐symmetric interior penalty DG methods (including the higher‐order cases) on problems with complicated, high contrast jumps in the coefficients. The solver is robust with respect to an increase in the polynomial degree of the DG approximation space (at least up to degree 6), computationally efficient, and affected only mildly by the coefficient jumps and by the mesh size h (i.e., number of iterations = O(log h−1)). Copyright © 2012 John Wiley & Sons, Ltd.