OpenAlex ·
The $α$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
- Published
- Source
- OpenAlex
- DOI
- 10.48550/arxiv.2609.01237
- Original
- Read it at the publisher
- Topics
Abstract
We study the singular limit of a family of linear degenerate interface transmission problems arising from a regularization procedure in the newly proposed Two-Parameter Diffuse Domain Method (DDM2p). For $α>0$, the regularized problem admits a strictly convex variational formulation on $H^{1}(Ω)$. In the limit $α\to0$, the problem degenerates to a weakly coupled interface system with a nonstandard energy structure. To characterize the limit, we introduce a closed Hilbert subspace $\mathcal{H}\subset H^{1}(Ω)$, defined through an auxiliary Helmholtz problem on an annular subdomain $Ω_2\subset Ω$, and identify the limiting energy functional $\mathcal{E}_{0}$ on $\mathcal{H}$. We prove that the regularized energies $\mathcal{E}_α$ $Γ$-converge to $\mathcal{E}_{0}$ in the strong $L^{2}(Ω)$ topology, using the standard framework. Consequently, minimizers of $\mathcal{E}_α$ converge to the unique minimizer of $\mathcal{E}_{0}$, which is shown to be equivalent to the solution of the limiting interface problem. We further prove strong convergence $u_α\to u_{0}$ in $H^{1}(Ω)$ and establish an $O(α)$ convergence rate. Numerical experiments in one spatial dimension confirm the predicted first-order convergence rate and suggest that this rate is sharp.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Projection-based low-rank assembly in IgA
Impact of Data Loss in Postprocessing on Training and Inference of Quantum Neural Networks
EvoGS: Modeling Deformation Evolution for Dynamic Gaussian Splatting
Fisher Information Dynamics: A Kinematic Framework for Phase Space Ordering with Applications to Shock Layers and Turbulence
Some explorations of Kirchhoff dynamics
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.