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
Clustering App Ad Hooks in Go: TF-IDF, Cosine Similarity and a Hand-Labelled Sample, and the Walls You'll Hit (2026)
0dev.to
Building a Simple REST API with FastAPI: A Step-by-Step Guide for Beginners
0dev.to
What It Takes to Trust an AI Agent With Real Work
0dev.to
How to check that a PDF converter does not upload your file anywhere
0dev.to
One TPU v6e chip holds 927 agent sessions with host-held state and 5 with a kept chat (memory only)
0dev.to
How to redesign a website without losing Google rankings
0dev.to UX