Sébastien Loisel

most citedEfficient algorithms for solving the

p

-Laplacian in polynomial time

16 citations · 16 across the 2 of their papers we have counts for

collaborators

2 papers

math.NA2023

Algorithm MGB to solve highly nonlinear elliptic PDEs in $O ~ (n)$ FLOPS

Sébastien Loisel

We introduce Algorithm MGB (Multi Grid Barrier) for solving highly nonlinear convex Euler-Lagrange equations. This class of problems includes many highly nonlinear partial differen…

math.NA2020★ 16 cited

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

Sébastien Loisel

The $p$ -Laplacian is a nonlinear partial differential equation, parametrized by $p \in [1, \infty]$ . We provide new numerical algorithms, based on the barrier method, for solving th…

Algorithm MGB to solve highly nonlinear elliptic PDEs in O~(n) FLOPS

Efficient algorithms for solving the p-Laplacian in polynomial time

Algorithm MGB to solve highly nonlinear elliptic PDEs in $O ~ (n)$ FLOPS

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