On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian
This paper concerns the best Lipschitz extension problem for a discrete distance that counts the number of steps. We relate this absolutely minimizing Lipschitz extension with a discrete ∞-Laplacian problem, which arises as the dynamic programming formula for the value function of some ε-tug-of-war...
Guardado en:
| Autores principales: | Mazón, J.M., Rossi, J.D., Toledo, J. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00217824_v97_n2_p98_Mazon |
| Aporte de: |
Ejemplares similares
-
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian
por: Rossi, Julio Daniel
Publicado: (2012) -
An obstacle problem for tug-of-war games
por: Manfredi, J.J., et al. -
Tug-of-war games and the infinity laplacian with spatial dependence
por: Gómez, I., et al. -
An obstacle problem for tug-of-war games
por: Rossi, Julio Daniel
Publicado: (2015) -
Tug-of-war games and the infinity laplacian with spatial dependence
por: Rossi, Julio Daniel
Publicado: (2013)