Table of Contents
Fetching ...

Subspace decomposition with defect diffusion coefficient

Dilini Kolombage, Axel Målqvist, Barbara Verfürth

Abstract

Elliptic diffusion problems with multiscale heterogeneous coefficients lead to poorly conditioned discrete systems and therefore require effective preconditioning strategies. While subspace decomposition preconditioners perform well for fixed realizations of the coefficient, their repeated construction becomes prohibitively expensive in uncertainty quantification settings, particularly in Monte-Carlo simulations, where a large number of fine-scale realizations must be treated. In this study, we propose an offline-online approximation of a subspace decomposition preconditioner that exploits the localized structure of the random defects. The preconditioner is constructed from local subspace solves that are precomputed offline for a small set of reference configurations and efficiently combined online for arbitrary realizations. We analyze the spectral properties of the resulting offline-online approximation operator and confirm its robustness and efficiency through numerical experiments.

Subspace decomposition with defect diffusion coefficient

Abstract

Elliptic diffusion problems with multiscale heterogeneous coefficients lead to poorly conditioned discrete systems and therefore require effective preconditioning strategies. While subspace decomposition preconditioners perform well for fixed realizations of the coefficient, their repeated construction becomes prohibitively expensive in uncertainty quantification settings, particularly in Monte-Carlo simulations, where a large number of fine-scale realizations must be treated. In this study, we propose an offline-online approximation of a subspace decomposition preconditioner that exploits the localized structure of the random defects. The preconditioner is constructed from local subspace solves that are precomputed offline for a small set of reference configurations and efficiently combined online for arbitrary realizations. We analyze the spectral properties of the resulting offline-online approximation operator and confirm its robustness and efficiency through numerical experiments.
Paper Structure (1 section, 1 equation, 1 figure)

This paper contains 1 section, 1 equation, 1 figure.

Table of Contents

  1. Introduction

Figures (1)

  • Figure 1.1: The random erasure model in two-dimension with $\alpha=1$, $\beta=10, p=0.1,\, \varepsilon=2^{-4}$ and $h=2^{-9}$.