AI & ML
Shape Perturbation of the Galerkin Boundary Element Dirichlet-to-Neumann Matrix on Moving Polygons
arXiv cs.NA0 views
arXiv:2611.14349v1 Announce Type: new Abstract: For nonlocal interface evolution problems such as the Mullins-Sekerka flow, certain parametric schemes discretize only the interface and approximate the Dirichlet-to-Neumann map by boundary elements. Their error analysis requires bounds on how this discrete operator changes as the polygon moves. In that analysis, the polygons are only Lipschitz and close to a smooth curve only in a Lipschitz norm, the perturbations are controlled only in the energy norm, and the kernels are singular on the diagonal. We study the symmetric Galerkin boundary element matrix on the polygons in a Lipschitz neighborhood of a smooth reference curve. Its first variation, tested against discrete Neumann solutions, is bounded by the energy norm of the perturbation alone. The second-order remainder of the associated mass form is bounded by the product of the energy norm and the Lipschitz norm of the perturbation, so that only one of the two factors needs a uniform bound. On the interpolating polygon, the matrix is consistent with the continuous operator without the logarithmic loss that a pointwise comparison of the kernels would suggest, and its shape derivative is consistent with that of the continuous operator. All bounds are uniform in the mesh size and depend only on the constants of the reference curve.
Source:https://arxiv.org/abs/2611.14349PreviousNumerical analysis of coupled flow, deformation and frictional contact mechanics in a fractured porous mediumNextA fourth-order dimensionally split exponential time differencing scheme with real and distinct pole rational approximation for non-linear reaction-diffusion systems
Related posts
Cogent and OpenAI build cyber defense factories for enterprises
0OpenAI Blog
ChatGPT Plus for veterans and servicemembers
0OpenAI Blog
Hitting 200 Strokes: What the Signature Maker Does at Its Stroke Limit
0dev.to
A Lightweight, Open-Source Network Digital Twin Blueprint for IoT-Edge Environments
0arXiv cs.NI
Bridge: Optimizing Collective Communication Schedules in Reconfigurable Networks with Reusable Subrings
0arXiv cs.NI
SplitCom: Communication-efficient Split Federated Fine-tuning of LLMs via Temporal Compression
0arXiv cs.NI