DeepAI
Log In Sign Up

Convergent, with rates, methods for normalized infinity Laplace, and related, equations

09/13/2022
by   Wenbo Li, et al.
0

We propose a monotone, and consistent numerical scheme for the approximation of the Dirichlet problem for the normalized Infinity Laplacian, which could be related to the family of so–called two–scale methods. We show that this method is convergent, and prove rates of convergence. These rates depend not only on the regularity of the solution, but also on whether or not the right hand side vanishes. Some extensions to this approach, like obstacle problems and symmetric Finsler norms are also considered.

READ FULL TEXT
10/17/2022

Ratio convergence rates for Euclidean first-passage percolation: Applications to the graph infinity Laplacian

In this paper we prove the first quantitative convergence rates for the ...
11/24/2021

Uniform Convergence Rates for Lipschitz Learning on Graphs

Lipschitz learning is a graph-based semi-supervised learning method wher...
10/29/2019

Improved spectral convergence rates for graph Laplacians on epsilon-graphs and k-NN graphs

In this paper we improve the spectral convergence rates for graph-based ...
07/13/2020

Lipschitz regularity of graph Laplacians on random data clouds

In this paper we study Lipschitz regularity of elliptic PDEs on geometri...
04/17/2020

The Infinity Laplacian eigenvalue problem: reformulation and a numerical scheme

In this work we present an alternative formulation of the higher eigenva...
11/02/2021

Two neural-network-based methods for solving obstacle problems

Two neural-network-based numerical schemes are proposed to solve the cla...
01/24/2020

A continuum limit for the PageRank algorithm

Semi-supervised and unsupervised machine learning methods often rely on ...