Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Abstract : Randers distances are an asymmetric generalization of Riemannian distances, and arise in optimal control problems subject to a drift term, among other applications. We show that Randers eikonal equation can be approximated by a logarithmic transformation of an anisotropic second order linear equation, generalizing Varadhan's formula for Riemannian manifolds. Based on this observation, we establish the convergence of a numerical method for computing Randers distances, from point sources or from a domain's boundary, on Cartesian grids of dimension two and three, which is consistent at order two thirds, and uses tools from low-dimensional algorithmic geometry for best efficiency. We also propose a numerical method for optimal transport problems whose cost is a Randers distance, exploiting the linear structure of our discretization and generalizing previous works in the Riemannian case. Numerical experiments illustrate our results.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03125879
Contributor : Guillaume Bonnet <>
Submitted on : Wednesday, June 9, 2021 - 5:54:55 PM
Last modification on : Tuesday, July 13, 2021 - 3:15:06 AM

File

randers.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03125879, version 2

Citation

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

Share

Metrics

Record views

38

Files downloads

16