Reduced-Basis approach for homogenization beyond the periodic setting
Sébastien Boyaval
Abstract
We consider the computation of averaged coefficients for the homogenization of elliptic partial differential equations. In this problem, like in many multiscale problems, a large number of similar computations parametrized by the macroscopic scale is required at the microscopic scale. This is a framework very much adapted to model order reduction attempts. The purpose of this work is to show how the reduced-basis approach allows to speed up the computation of a large number of cell problems without any loss of precision. The essential components of this reduced-basis approach are the a posteriori error estimation, which provides sharp error bounds for the outputs of interest, and an approximation process divided into offline and online stages, which decouples the generation of the approximation space and its use for Galerkin projections.
Create a lesson
Related papers
Sensitivity Calculus and its Numerical Implementation for Multi-D Hyperbolic Balance Laws
Olivia Dreßen, Michael Herty, Adrian Kolb et al.
A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New
Wanjie Lyu, Xiaojie Wang, Bin Yang
Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers
Nilo Schwencke, Roland Maier
Incremental Column Subset Selection via Conditional Determinantal Point Processes
Laura Grigori, Zhipeng Xue
A Hybrid High-Order Method for the Elasticity Problem with Linear Slip Interface
Erik Burman, Peiqi Huang
Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model
Stefan Schnake, Miroslav Stoyanov, Eirik Endeve et al.