Efficient algorithms for solving the p-Laplacian in polynomial time

07/29/2020
by   Sébastien Loisel, et al.
0

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
POST COMMENT

Comments

There are no comments yet.

Authors

page 21

08/26/2021

Deep Ritz method for the spectral fractional Laplacian equation using the Caffarelli-Silvestre extension

In this paper, we propose a novel method for solving high-dimensional sp...
03/18/2022

Numerical Solution for a Class of Evolution Differential Equations with p-Laplacian and Memory

In this paper we make a study of a partial integral differential equatio...
03/21/2022

A Vanka-type multigrid solver for complex-shifted Laplacian systems from diagonalization-based parallel-in-time algorithms

We propose and analyze a Vanka-type multigrid solver for solving a seque...
03/29/2018

Polynomial-Time Algorithms for Submodular Laplacian Systems

Let G=(V,E) be an undirected graph, L_G∈R^V × V be the associated Laplac...
11/07/2018

Solving Jigsaw Puzzles By The Graph Connection Laplacian

We propose a novel mathematical framework to address the problem of auto...
03/10/2018

Efficient FPGA Implementation of Conjugate Gradient Methods for Laplacian System using HLS

In this paper, we study FPGA based pipelined and superscalar design of t...
07/01/2018

A polynomial time log barrier method for problems with nonconvex constraints

Interior point methods (IPMs) that handle nonconvex constraints such as ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.