A linear finite-difference scheme for approximating Randers distances on Cartesian grids - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2021

A linear finite-difference scheme for approximating Randers distances on Cartesian grids

Abstract

Using an extension of Varadhan's formula to Randers manifolds, we notice that Randers distances may be approximated by a logarithmic transformation of a linear second-order partial differential equation. Following an idea introduced by Crane, Weischedel, and Wardetzky in the case of Riemannian distances, we study a numerical method for approximating Randers distances which involves a discretization of this linear equation. We propose to use Selling's formula, which originates from the theory of low-dimensional lattice geometry, to build a monotone and linear finite-difference scheme. By injecting the logarithmic transformation in this linear scheme, we are able to prove convergence of this numerical method to the Randers distance, as well as consistency to the order two thirds far from the boundary of the considered domain. We explain how this method may be used to approximate optimal transport distances, how has been previously done in the Riemannian case.
Fichier principal
Vignette du fichier
randers.pdf (1.37 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03125879 , version 1 (29-01-2021)
hal-03125879 , version 2 (09-06-2021)
hal-03125879 , version 3 (21-03-2022)

Identifiers

  • HAL Id : hal-03125879 , version 1

Cite

Frédéric Bonnans, Guillaume Bonnet, Jean-Marie Mirebeau. A linear finite-difference scheme for approximating Randers distances on Cartesian grids. 2021. ⟨hal-03125879v1⟩

Collections

ANR
258 View
183 Download

Share

Gmail Facebook X LinkedIn More