The iterative solver template library

Authors:
Markus Blatt;Peter Bastian
Affiliations:
Institut für Parallele und Verteilte Systeme, Universität Stuttgart, Stuttgart, Germany;Institut für Parallele und Verteilte Systeme, Universität Stuttgart, Stuttgart, Germany
Venue:
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Year:
2006

Citing 3
Cited 6

The approximate Dirichlet domain decomposition method. Part I: an algebraic approach

Computing
The C++ Programming Language, Third Edition

The C++ Programming Language, Third Edition
Scientific and Engineering C++: An Introduction with Advanced Techniques and Examples

Scientific and Engineering C++: An Introduction with Advanced Techniques and Examples

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

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

International Journal of Computational Science and Engineering
The dune-subgrid module and some applications

Computing
Supporting the testing of scientific frameworks with software product line engineering: a proposed approach

Proceedings of the 4th International Workshop on Software Engineering for Computational Science and Engineering
Sparse systems solving on GPUs with GMRES

The Journal of Supercomputing
A template system for the efficient compilation of domain abstractions onto reconfigurable computers

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The numerical solution of partial differential equations frequently requires the solution of large and sparse linear systems. Using generic programming techniques in C++ one can create solver libraries that allow efficient realization of "fine grained interfaces", i.e. with functions consisting only of a few lines, like access to individual matrix entries. This prevents code replication and allows programmers to work more efficiently. We present the "Iterative Solver Template Library" (ISTL) which is part of the "Distributed and Unified Numerics Environment" (DUNE). It applies generic programming in C++ to the domain of iterative solvers of linear systems stemming from finite element discretizations. Those discretizations exhibit a lot of structure. Our matrix and vector interface supports a block recursive structure. Each sparse matrix entry can itself be either a sparse or a small dense matrix. Based on this interface we present efficient solvers that use the recursive block structure via template metaprogramming.