Efficient algorithms for solving the p-Laplacian in polynomial time

Sébastien Loisel*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)
67 Downloads (Pure)


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(nlogn) Newton iterations for all p∈ [1 , ∞] , where n is the number of grid points. We confirm our estimates with numerical experiments.

Original languageEnglish
Pages (from-to)369-400
Number of pages32
JournalNumerische Mathematik
Issue number2
Early online date24 Aug 2020
Publication statusPublished - Oct 2020

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Efficient algorithms for solving the p-Laplacian in polynomial time'. Together they form a unique fingerprint.

Cite this