A reduced basis localized orthogonal decomposition

Assyr Abdulle, Patrick Henning
2015
Article

Résumé

In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high dimensional Finite Element space into a low dimensional space with comparably good approximation properties and a remainder space with negligible information. The low dimensional space is spanned by locally supported basis functions associated with the node of a coarse mesh obtained by solving decoupled local problems. However, for parameter dependent multiscale problems, the local basis has to be computed repeatedly for each choice of the parameter. To overcome this issue, we propose an RB approach to compute in an "offline" stage LOD for suitable representative parameters. The online solution of the multiscale problems can then be obtained in a coarse space (thanks to the LOD decomposition) and for an arbitrary value of the parameters (thanks to a suitable "interpolation" of the selected RB). The online RB-LOD has a basis with local support and leads to sparse systems. Applications of the strategy to both linear and nonlinear problems are given.

Official source

https://infoscience.epfl.ch/record/202098?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés

Chargement

Publications associées

Chargement

The characteristic of effective properties of physical processes in heterogeneous media is a basic modeling and computational problem for many applications. As standard numerical discretization of such multiscale problems (e.g. with classical finite element method (FEM)) is often computationally prohibitive, there is a need for a novel computational algorithm able to capture the effective behavior of the physical system without resolving the finest scale in the system on the whole computational domain. In this thesis we propose and analyze a new class of numerical methods that combine the so-called finite element heterogeneous multiscale method (FE-HMM) with reduced order modeling techniques for linear and nonlinear multiscale problems. In the first part of the thesis we generalize the FE-HMM to elliptic problems with an arbitrary number of well-separated scales. We provide a rigorous a priori error analysis of this method that generalizes previous work restricted to two-scale problems. In the second part of the thesis, we develop our new reduced order multiscale method that combines the FE-HMM with reduced basis (RB) method. This method, the reduced basis finite element heterogeneous multiscale method (RB-FE-HMM) provides a significant improvement in computational efficiency compared to the FE-HMM, specially for high dimensional problems or high order methods. A priori and a posteriori error analyses are derived for linear elliptic problems, as well as goal oriented adaptivity techniques. The RB-FE-HMM is then generalized to a class of nonlinear elliptic and parabolic problems. A priori error analysis and extensive computational results for nonlinear problems are also provided.

EPFL2013

Chargement

This thesis is devoted to the derivation of error estimates for partial differential equations with random input data, with a focus on a posteriori error estimates which are the basis for adaptive strategies. Such procedures aim at obtaining an approximation of the solution with a given precision while minimizing the computational costs. If several sources of error come into play, it is then necessary to balance them to avoid unnecessary work. We are first interested in problems that contain small uncertainties approximated by finite elements. The use of perturbation techniques is appropriate in this setting since only few terms in the power series expansion of the exact random solution with respect to a parameter characterizing the amount of randomness in the problem are required to obtain an accurate approximation. The goal is then to perform an error analysis for the finite element approximation of the expansion up to a certain order. First, an elliptic model problem with random diffusion coefficient with affine dependence on a vector of independent random variables is studied. We give both a priori and a posteriori error estimates for the first term in the expansion for various norms of the error. The results are then extended to higher order approximations and to other sources of uncertainty, such as boundary conditions or forcing term. Next, the analysis of nonlinear problems in random domains is proposed, considering the one-dimensional viscous Burgers' equation and the more involved incompressible steady-state Navier-Stokes equations. The domain mapping method is used to transform the equations in random domains into equations in a fixed reference domain with random coefficients. We give conditions on the mapping and the input data under which we can prove the well-posedness of the problems and give a posteriori error estimates for the finite element approximation of the first term in the expansion. Finally, we consider the heat equation with random Robin boundary conditions. For this parabolic problem, the time discretization brings an additional source of error that is accounted for in the error analysis. The second part of this work consists in the analysis of a random elliptic diffusion problem that is approximated in the physical space by the finite element method and in the stochastic space by the stochastic collocation method on a sparse grid. Considering a random diffusion coefficient with affine dependence on a vector of independent random variables, we derive a residual-based a posteriori error estimate that controls the two sources of error. The stochastic error estimator is then used to drive an adaptive sparse grid algorithm which aims at alleviating the so-called curse of dimensionality inherent to tensor grids. Several numerical examples are given to illustrate the performance of the adaptive procedure.

EPFL2016

Chargement

EPFL2016