betaFeedback

WorksMathematics

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

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 εε-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.

Paper details

vlnc:W_zx5yfwm2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT

View statement
Looking for related papers…