Oberwolfach Reports

Full-Text PDF (712 KB) | Introduction as PDF | Metadata | Table of Contents | OWR summary
Volume 13, Issue 3, 2016, pp. 2513–2570
DOI: 10.4171/OWR/2016/44

Published online: 2017-04-22

Adaptive Algorithms

Carsten Carstensen[1] and Rob Stevenson[2]

(1) Humboldt-Universität zu Berlin, Germany
(2) University of Amsterdam, The Netherlands

Overwhelming empirical evidence in computational science and engineering proved that self-adaptive mesh-generation is a must-do in real-life problem computational partial differential equations. The mathematical understanding of corresponding algorithms concerns the overlap of two traditional mathematical disciplines, numerical analysis and approximation theory, with computational sciences. The half workshop was devoted to the mathematics of optimal convergence rates and instance optimality of the Dörfler marking or the maximum strategy in various versions of space discretisations and time-evolution problems with all kind of applications in the efficient numerical treatment of partial differential equations.

No keywords available for this article.

Carstensen Carsten, Stevenson Rob: Adaptive Algorithms. Oberwolfach Rep. 13 (2016), 2513-2570. doi: 10.4171/OWR/2016/44