<p>This work introduces a novel hybrid framework that combines operator learning with finite difference discretization to efficiently and accurately solve elliptic interface problems. These problems are characterized by discontinuous coefficients and large jump conditions across complex interfaces. Reformulating the interior-domain flux as an augmented variable denoted by <i>B</i>, we construct an operator <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathcal {G}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">G</mi> </math></EquationSource> </InlineEquation> that maps <i>B</i> to the solution <i>u</i> of the elliptic problem. This operator is then embedded in a convex optimization problem constrained by the first interface condition (solution jump). Theoretical analysis demonstrates the convexity and uniqueness of the reformulated problem, with error estimates derived under the assumption of Lipschitz continuity. Numerical experiments on five benchmark problems, including smooth/non-smooth coefficients, complex geometries, and high-contrast material properties, show that our method achieves exponential convergence rates, requiring 2-3 orders of magnitude fewer degrees of freedom than traditional mesh-based methods. The proposed approach is novel, as it eliminates the need for interface-fitted meshes while maintaining spectral accuracy, and demonstrates significant potential for multi-physics simulations.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Hybrid Predictor–Corrector Decoupled Method Based on Operator Learning for Solving Interface Problems

  • Chen Fan,
  • Siyuan Lang,
  • Muhammad Toseef,
  • Zhiyue Zhang

摘要

This work introduces a novel hybrid framework that combines operator learning with finite difference discretization to efficiently and accurately solve elliptic interface problems. These problems are characterized by discontinuous coefficients and large jump conditions across complex interfaces. Reformulating the interior-domain flux as an augmented variable denoted by B, we construct an operator \(\mathcal {G}\) G that maps B to the solution u of the elliptic problem. This operator is then embedded in a convex optimization problem constrained by the first interface condition (solution jump). Theoretical analysis demonstrates the convexity and uniqueness of the reformulated problem, with error estimates derived under the assumption of Lipschitz continuity. Numerical experiments on five benchmark problems, including smooth/non-smooth coefficients, complex geometries, and high-contrast material properties, show that our method achieves exponential convergence rates, requiring 2-3 orders of magnitude fewer degrees of freedom than traditional mesh-based methods. The proposed approach is novel, as it eliminates the need for interface-fitted meshes while maintaining spectral accuracy, and demonstrates significant potential for multi-physics simulations.