Source-linked AI summary

Oversampling for the Multiscale Finite Element Method

Patrick Henning, Daniel Peterseim

arXiv:1211.5954v2math.NA

TL;DR

Classical MsFEM oversampling lacks a rigorous, broadly applicable convergence guarantee when scale separation is absent or microscopic scales are unknown. The paper imposes constraints separating local trial and test functions from coarse functions, derives quantitative error estimates, and shows that logarithmic oversampling layers preserve convergence without resonance effects under general coefficient assumptions.

  • Problem

    Existing MsFEM oversampling strategies face resonance concerns, while prior results may require known microscopic scales or provide only qualitative guidance for choosing patch thickness.

  • Method

    The paper reviews standard strategies and proposes constrained oversampling, restricting local trial and test spaces to functions linearly independent of coarse finite element functions.

  • Results

    Oversampling layers of thickness H log(H−1) preserve common convergence rates without preasymptotic effects and prevent resonance errors for general L∞ coefficients.

  • Takeaways & Limitations

    The constrained strategy provides a reliable MsFEM oversampling method with a rigorous quantitative error analysis under general coefficient and microstructure conditions.

  • Takeaways & Limitations

    Earlier qualitative and quantitative results do not determine patch thickness reliably when oscillations lack scale separation or the microscopic parameter ε is unknown.

Abstract

from arXiv · show

This paper reviews standard oversampling strategies as performed in the Multiscale Finite Element Method (MsFEM). Common to those approaches is that the oversampling is performed in the full space restricted to a patch but including coarse finite element functions. We suggest, by contrast, to perform local computations with the additional constraint that trial and test functions are linear independent from coarse finite element functions. This approach re-interprets the Variational Multiscale Method in the context of computational homogenization. This connection gives rise to a general fully discrete error analysis for the proposed multiscale method with constrained oversampling without any resonance effects. In particular, we are able to give the first rigorous proof of convergence for a MsFEM with oversampling.

1 Introduction

Multiscale methods address heterogeneous PDEs by combining localized fine-scale computations with a global coarse problem. For MsFEM, resonance errors motivate oversampling and the paper proposes a strategy with quantitative error estimates.

  • Highly heterogeneous coefficients require fine meshes to resolve microscopic structures across the computational domain.Such coefficients arise in applications including porous-media flow and groundwater solute transport.
  • Multiscale methods decouple global fine-scale problems into localized subproblems plus a global coarse problem.The paper places MsFEM among methods including HMM and the Variational Multiscale Method.
  • MsFEM modifies coarse finite element basis functions with fine-scale corrector functions computed from local problems.The correctors act as local perturbations that capture finer-scale variations.
  • Classical MsFEM resonance errors are typically O(ε/H), becoming large when coarse-grid and microscopic length scales are comparable.The error is linked to boundary-condition mismatch and unrepresentative sampling-patch size or geometry.
  • When scale separation is unclear, the microscopic length ε may be unknown or nonexistent, making resonance risk difficult to predict.The paper therefore reviews oversampling strategies and proposes a new strategy with quantitative error estimates under general diffusion-coefficient assumptions.

2 The Multiscale Finite Element Method

The classical MsFEM enriches a coarse finite element space using locally computed fine-scale corrections. Its formulation constructs conforming multiscale basis functions from local problems and solves a coarse variational problem without directly solving the large fine-scale equation.

  • The method uses coarse and fine discretization scales H ≥ h, with the fine scale typically resolving variations of the diffusion coefficient.The coarse scale is arbitrary, while h may be constrained by the coefficient’s characteristic variation length.
  • The coarse approximation is computed through a variational formulation in the multiscale space, while the fine-scale Galerkin solution serves only as a reference.The large-scale fine-grid equation is never solved directly.
  • MsFEM enriches standard coarse basis functions by solving local fine-scale problems and adding corrector functions as local perturbations.This preserves a coarse representation while incorporating fine-scale information.
  • Each multiscale basis function is uniquely determined through local conditions involving fine-scale test functions supported inside coarse elements.The resulting basis functions agree with the corresponding coarse functions on element boundaries.
  • The span of the multiscale basis functions forms a conforming MsFEM solution space contained in the homogeneous Sobolev space.This distinguishes the classical no-oversampling construction from generally nonconforming oversampled approximations.

3 Oversampling strategies

Standard oversampling enlarges local problem domains to reduce boundary and sampling errors, but existing strategies retain resonance, stability, and predictability limitations. The proposed constrained strategy targets these issues with quantitative guarantees under broad assumptions.

  • Standard oversampling: Oversampling solves local problems on larger patches while communicating only interior information to the coarse equation, reducing wrong-boundary-condition and bad-sampling effects.Both common strategies generalize the non-oversampled MsFEM, but differ in how local spaces are extended.
  • Limitations of existing strategies: The Petrov-Galerkin formulation can have better estimates than the symmetric version, but existence, uniqueness, and stability were not established for general oversampling.The symmetric formulation is well posed through ellipticity, whereas the corresponding Petrov-Galerkin argument lacks that guarantee.
  • Limitations of existing strategies: Existing strategies can retain resonance errors, especially when the microscopic scale is unknown or comparable to the coarse mesh.Their estimates contain an O(ε) remainder and may require patch sizes large relative to ε, limiting reliable patch selection without scale information.
  • Proposed constrained strategy: The new strategy constrains local trial and test spaces to be linearly independent of coarse finite element functions, addressing resonance and stability concerns.The paper presents it as a third oversampling strategy with quantitative a-priori analysis in the fully discrete setting.
  • Proposed constrained strategy: Oversampling layers of thickness H log(H^-1) suffice to preserve common H-convergence rates without preasymptotic effects, while preventing resonance for general L∞ coefficients.The stated goals also include conforming approximations, all-dimensional quantitative analysis, and no restrictive coefficient-regularity assumptions.

4 Constrained oversampling

The paper introduces constrained oversampling, restricting local correctors to fine-scale functions independent of the coarse finite element space. This yields exponential corrector decay and quantitative error estimates without the usual H^-1 localization factor.

  • New strategy: Constrained oversampling computes local correctors in Wh, the kernel of a Clément-type quasi-interpolation operator IH, rather than the full fine-scale space Vh.Wh contains functions not captured by the coarse space VH, and the resulting decomposition is stable and orthogonal in L2(Ω).
  • Quantitative error estimates: Constrained correctors exhibit exponential-type decay, justifying localization on finite oversampling patches Uk(T).The decay rate parameter r is independent of the mesh size and coefficient variations, though it depends on the square root of the contrast.
  • New strategy: The strategy defines local correctors in constrained patch spaces and combines their weighted local contributions into a conforming global corrector.The resulting global corrector lies in Vh ⊂ H1, while the method remains well posed and stable in symmetric formulation.
  • Quantitative error estimates: With maximal oversampling, the new MsFEM is exact up to fine-scale discretization error and right-hand-side oscillations, independently of γmax and variations in A.This differs from the earlier oversampling strategies described in the paper.
  • Quantitative error estimates: Theorem 4.13 and Theorem 4.15 provide H1- and L2-error estimates for localized constrained oversampling with U(T)=Uk(T).The estimates compare the multiscale approximation with the fine-scale reference solution uh and use the decay parameter r.
  • Quantitative error estimates: The localization estimate omits the unpleasant H^-1 factor appearing in the comparison result cited from.The paper attributes this improvement to a summation property of its local problems that is unavailable in the localization strategy.

5 Numerical experiments

Numerical experiments compare three oversampling strategies for a two-dimensional model problem using Petrov-Galerkin formulations for Strategies 1 and 2 and a symmetric formulation for Strategy 3. The reported results match the predicted error behavior and show no accuracy loss for the new strategy under identical settings.

  • Experimental setup: The experiments compare oversampling Strategies 1, 2, and 3 using L2- and H1-errors relative to the fine-scale reference solution uh.Strategies 1 and 2 use Petrov-Galerkin formulations, while Strategy 3 uses a symmetric formulation.
  • Experimental setup: The model problem uses Ω=]0, 1[2 and ϵ = 5 · 10−2, with computations reported for h = 2−6 and varying H and oversampling layers.The tables also report coarse-layer counts k and fine-grid-layer counts.
  • Results: For identical H, h, and oversampling domains, Strategy 3 does not suffer the accuracy loss observed for the classical strategies.The comparison uses both L2- and H1-errors.

6 Conclusion

The paper concludes that constrained oversampling preserves common convergence rates with oversampling layers of thickness H log(H−1) and prevents resonance errors for general L∞ coefficients. It also identifies opportunities to reduce computational cost when coefficient structure is available.

  • Conclusion: Oversampling layers of thickness H log(H−1) suffice to preserve the common convergence rates with respect to H without preasymptotic effects.The conclusion presents this as a consequence of the proposed constrained oversampling strategy.
  • Conclusion: The method prevents resonance errors for general L∞ coefficients without assumptions on microstructure geometry or coefficient regularity.The authors characterize the method as reliable in this respect.
  • Conclusion: Structural knowledge such as local periodicity or scale separation may reduce the number of corrector problems considerably.Whether periodicity permits very small oversampling layers remains for future numerical or analytical investigation.
Loading 1211.5954v2…