Work

Efficient algorithms for solving the p-Laplacian in polynomial time

Year: 2020

Type: article

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.

Source: Numerische Mathematik

DOI: 10.1007/s00211-020-01141-z

Author: Sébastien Loisel

Institution: Heriot-Watt University

Language: Latvian

Topic: Advanced Numerical Methods in Computational Mathematics

Subfield: Computational Mechanics

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,750

Funder: Heriot-Watt University