
Give the Gift of Choice!
Too many options? Treat your friends and family to their favourite stores with a Bayshore Shopping Centre gift card, redeemable at participating retailers throughout the centre. Click below to purchase yours today!Purchase HereHome
Nonlocal Continuum Limits of p-Laplacian Problems on Graphs
Coles
Loading Inventory...
Nonlocal Continuum Limits of p-Laplacian Problems on Graphs in Ottawa, ON
By None
Current price: $29.54


By None
Nonlocal Continuum Limits of p-Laplacian Problems on Graphs in Ottawa, ON
Current price: $29.54
Loading Inventory...
Size: Paperback
*Product information may vary - to confirm product availability, pricing, shipping and return information please contact Coles
In this Element, the authors consider fully discretized p-Laplacian problems (evolution, boundary value and variational problems) on graphs. The motivation of nonlocal continuum limits comes from the quest of understanding collective dynamics in large ensembles of interacting particles, which is a fundamental problem in nonlinear science, with applications ranging from biology to physics, chemistry and computer science. Using the theory of graphons, the authors give a unified treatment of all the above problems and establish the continuum limit for each of them together with non-asymptotic convergence rates. They also describe an algorithmic framework based proximal splitting to solve these discrete problems on graphs.
In this Element, the authors consider fully discretized p-Laplacian problems (evolution, boundary value and variational problems) on graphs. The motivation of nonlocal continuum limits comes from the quest of understanding collective dynamics in large ensembles of interacting particles, which is a fundamental problem in nonlinear science, with applications ranging from biology to physics, chemistry and computer science. Using the theory of graphons, the authors give a unified treatment of all the above problems and establish the continuum limit for each of them together with non-asymptotic convergence rates. They also describe an algorithmic framework based proximal splitting to solve these discrete problems on graphs.

















