Offline Error Bounds for the Reduced Basis Method

Author(s):  
Robert O’Connor ◽  
Martin Grepl
2014 ◽  
Vol 24 (09) ◽  
pp. 1903-1935 ◽  
Author(s):  
Masayuki Yano ◽  
Anthony T. Patera ◽  
Karsten Urban

We present a space-time interpolation-based certified reduced basis method for Burgers' equation over the spatial interval (0, 1) and the temporal interval (0, T] parametrized with respect to the Peclet number. We first introduce a Petrov–Galerkin space-time finite element discretization which enjoys a favorable inf–sup constant that decreases slowly with Peclet number and final time T. We then consider an hp interpolation-based space-time reduced basis approximation and associated Brezzi–Rappaz–Raviart a posteriori error bounds. We describe computational offline–online decomposition procedures for the three key ingredients of the error bounds: the dual norm of the residual, a lower bound for the inf–sup constant, and the space-time Sobolev embedding constant. Numerical results demonstrate that our space-time formulation provides improved stability constants compared to classical L2-error estimates; the error bounds remain sharp over a wide range of Peclet numbers and long integration times T, in marked contrast to the exponentially growing estimate of the classical formulation for high Peclet number cases.


2016 ◽  
Vol 49 (8) ◽  
pp. 1-6 ◽  
Author(s):  
Robert O’Connor

PAMM ◽  
2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Sophia Bremm ◽  
Philipp L. Rosendahl ◽  
Wilfried Becker

Author(s):  
Lifeng Wu ◽  
Yanwen Zhao ◽  
Qiangmin Cai ◽  
Zhipeng Zhang ◽  
Jun Hu

2011 ◽  
Author(s):  
Jan Pomplun ◽  
Sven Burger ◽  
Lin Zschiedrich ◽  
Frank Schmidt

2011 ◽  
Author(s):  
Frank Schmidt ◽  
Jan Pomplun ◽  
Lin Zschiedrich ◽  
Sven Burger

Sign in / Sign up

Export Citation Format

Share Document