Hostname: page-component-6766d58669-fx4k7 Total loading time: 0 Render date: 2026-05-21T11:15:50.899Z Has data issue: false hasContentIssue false

Double greedy algorithms: Reduced basis methods for transport dominated problems

Published online by Cambridge University Press:  20 January 2014

Wolfgang Dahmen
Affiliation:
Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056 Aachen, Germany.. dahmen@igpm.rwth-aachen.de; plesken@igpm.rwth-aachen.de; welper@igpm.rwth-aachen.de
Christian Plesken
Affiliation:
Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056 Aachen, Germany.. dahmen@igpm.rwth-aachen.de; plesken@igpm.rwth-aachen.de; welper@igpm.rwth-aachen.de
Gerrit Welper
Affiliation:
Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056 Aachen, Germany.. dahmen@igpm.rwth-aachen.de; plesken@igpm.rwth-aachen.de; welper@igpm.rwth-aachen.de
Get access

Abstract

The central objective of this paper is to develop reduced basis methods for parameter dependent transport dominated problems that are rigorously proven to exhibit rate-optimal performance when compared with the Kolmogorov n-widths of the solution sets. The central ingredient is the construction of computationally feasible “tight” surrogates which in turn are based on deriving a suitable well-conditioned variational formulation for the parameter dependent problem. The theoretical results are illustrated by numerical experiments for convection-diffusion and pure transport equations. In particular, the latter example sheds some light on the smoothness of the dependence of the solutions on the parameters.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2014

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable