Backend
A graph discretization of the Steklov and Neumann problems on domains in complete Riemannian manifolds
arXiv cs.NA0 views
arXiv:2611.17491v1 Announce Type: cross Abstract: We establish quantitative spectral convergence for graph discretizations of the Steklov and Neumann problems for bounded domains in complete Riemannian manifolds. Our construction uses weighted proximity graphs built from maximal $\epsilon$-separated sets, with a correction to the discrete energy accounting for the geometry near the boundary. We consider two discrete Steklov problems: one defined using an averaged boundary trace, and the other using restriction to boundary vertices. Both approximate the continuum Steklov spectrum, but under different conditions on the discretization parameters. The additional scale condition required for the restriction-based problem is also necessary for spectral convergence. As a byproduct, we obtain quantitative convergence of the Neumann spectrum. The estimates are uniform under suitable geometric bounds.
Source:https://arxiv.org/abs/2611.17491PreviousScore-based neural ordinary differential equations for reaction-diffusionsNextProximal Adam algorithm for nonsmooth composite optimization and linear convergence under proximal PL geometry
Related posts
1,016 TOPS per car: Pony.ai's Plan B for life after Nvidia
0dev.to Discuss
Your Integration Code Is Already a Workflow
0dev.to Discuss

Your Coding Agent Shouldn't Be Able to Close Its Own Ticket
0dev.to Discuss

My Sandbox Could Only Reach 3 Package Registries for 16 Weeks. This Week It Reached 8 — and One of Them Leaks Whether 2FA Is On
0dev.to Discuss
5 Python Scripts Every Tech Enthusiast Should Know for Automating Their Daily Life
0dev.to Productivity
Tencent's Hy4 Flash: A 224B Model That Costs 1/20th of Its Flagship — Here's the Trade-Off
0dev.to Productivity