Efficient algorithms for solving the \(p\)-Laplacian in polynomial time

From MaRDI portal
Publication:2209522

DOI10.1007/s00211-020-01141-zzbMath1458.65151arXiv2007.15044OpenAlexW3103039007MaRDI QIDQ2209522

Sébastien Loisel

Publication date: 2 November 2020

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.15044




Related Items (4)



Cites Work


This page was built for publication: Efficient algorithms for solving the \(p\)-Laplacian in polynomial time