← ALB News · curated headline

A graph discretization of the Steklov and Neumann problems on domains in complete Riemannian manifolds

arXiv Mathematics · WORLD · Mathematics · 11/16/2026, 12:00:00 AM

arXiv:2611.17491v1 Announce Type: new 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.

Continue to arXiv Mathematics →

You are being forwarded in 6s — stay on this page