Efficient algorithms for solving the p-Laplacian in polynomial time

Sébastien Loisel

doi:10.1007/s00211-020-01141-z

Efficient algorithms for solving the p-Laplacian in polynomial time

Sébastien Loisel^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

142 Downloads (Pure)

Abstract

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 language	English
Pages (from-to)	369-400
Number of pages	32
Journal	Numerische Mathematik
Volume	146
Issue number	2
Early online date	24 Aug 2020
DOIs	https://doi.org/10.1007/s00211-020-01141-z
Publication status	Published - Oct 2020

ASJC Scopus subject areas

Computational Mathematics
Applied Mathematics

Access to Document

10.1007/s00211-020-01141-zLicence: CC BY

Download pdfFinal published version, 1.87 MBLicence: CC BY

Cite this

@article{c8f0a8aa736a4bf08217f7a61c17cc75,

title = "Efficient algorithms for solving the p-Laplacian in polynomial time",

abstract = "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.",

author = "S{\'e}bastien Loisel",

year = "2020",

month = oct,

doi = "10.1007/s00211-020-01141-z",

language = "English",

volume = "146",

pages = "369--400",

journal = "Numerische Mathematik",

issn = "0029-599X",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Efficient algorithms for solving the p-Laplacian in polynomial time

AU - Loisel, Sébastien

PY - 2020/10

Y1 - 2020/10

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85089738041

U2 - 10.1007/s00211-020-01141-z

DO - 10.1007/s00211-020-01141-z

M3 - Article

AN - SCOPUS:85089738041

SN - 0029-599X

VL - 146

SP - 369

EP - 400

JO - Numerische Mathematik

JF - Numerische Mathematik

IS - 2

ER -

Efficient algorithms for solving the p-Laplacian in polynomial time

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this