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
The $\alpha$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
0arXiv cs.NA
A Spectral Proximal DC Algorithm with Nonmonotone Line Search and Extrapolation
0arXiv cs.NA
Watch Your Step: Adam's Margin Maximization Bias Depends on the Learning Rate Schedule
0arXiv stat.ML
Minimizing classical resources in variational measurement-based quantum computation for generative modeling
0arXiv stat.ML
Deep Multivariate Models with Parametric Conditionals
0arXiv stat.ML
CoordX Types: A Trustless, Swappable Type System for Shared Records
0arXiv cs.CR