Efficient algorithms for solving the p-Laplacian in polynomial time
Keyword(s):
Abstract The p-Laplacian is a nonlinear partial differential equation, parametrized by $$p \in [1,\infty ]$$ p ∈ [ 1 , ∞ ] . We provide new numerical algorithms, based on the barrier method, for solving the p-Laplacian numerically in $$O(\sqrt{n}\log n)$$ O ( n log n ) Newton iterations for all $$p \in [1,\infty ]$$ p ∈ [ 1 , ∞ ] , where n is the number of grid points. We confirm our estimates with numerical experiments.
1994 ◽
Vol 05
(02)
◽
pp. 407-410
◽
2010 ◽
Vol 12
(2)
◽
pp. 125-131
2015 ◽
Vol 2015
◽
pp. 1-9
◽
2020 ◽
Vol 5
(1)
◽
pp. 1-7
2013 ◽
Vol 5
(04)
◽
pp. 407-422
◽
2014 ◽
Vol 9
(8)
◽
pp. 238-248
◽