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: | , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00217824_v97_n2_p98_Mazon |
| Aporte de: |
| id |
todo:paper_00217824_v97_n2_p98_Mazon |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_00217824_v97_n2_p98_Mazon2023-10-03T14:20:53Z On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian Mazón, J.M. Rossi, J.D. Toledo, J. Infinity laplacian Lipschitz extension Nonlocal p-Laplacian problem Tug-of-war games 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 games. As in the classical case, we obtain the absolutely minimizing Lipschitz extension of a datum f by taking the limit as p→ ∞ in a nonlocal p-Laplacian problem. © 2011 Elsevier Masson SAS. Fil:Rossi, J.D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_00217824_v97_n2_p98_Mazon |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Infinity laplacian Lipschitz extension Nonlocal p-Laplacian problem Tug-of-war games |
| spellingShingle |
Infinity laplacian Lipschitz extension Nonlocal p-Laplacian problem Tug-of-war games Mazón, J.M. Rossi, J.D. Toledo, J. On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian |
| topic_facet |
Infinity laplacian Lipschitz extension Nonlocal p-Laplacian problem Tug-of-war games |
| description |
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 games. As in the classical case, we obtain the absolutely minimizing Lipschitz extension of a datum f by taking the limit as p→ ∞ in a nonlocal p-Laplacian problem. © 2011 Elsevier Masson SAS. |
| format |
JOUR |
| author |
Mazón, J.M. Rossi, J.D. Toledo, J. |
| author_facet |
Mazón, J.M. Rossi, J.D. Toledo, J. |
| author_sort |
Mazón, J.M. |
| title |
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian |
| title_short |
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian |
| title_full |
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian |
| title_fullStr |
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian |
| title_full_unstemmed |
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian |
| title_sort |
on the best lipschitz extension problem for a discrete distance and the discrete ∞-laplacian |
| url |
http://hdl.handle.net/20.500.12110/paper_00217824_v97_n2_p98_Mazon |
| work_keys_str_mv |
AT mazonjm onthebestlipschitzextensionproblemforadiscretedistanceandthediscretelaplacian AT rossijd onthebestlipschitzextensionproblemforadiscretedistanceandthediscretelaplacian AT toledoj onthebestlipschitzextensionproblemforadiscretedistanceandthediscretelaplacian |
| _version_ |
1807322571675271168 |