Efficient algorithms for solving the p-Laplacian in polynomial time
share
The p-Laplacian is a nonlinear partial differential equation, parametrized by p ∈ [1,∞]. We provide new numerical algorithms, based on the barrier method, for solving the p-Laplacian numerically in O(√(n)log n) Newton iterations for all p ∈ [1,∞], where n is the number of grid points. We confirm our estimates with numerical experiments.
READ FULL TEXT