Metraipolis › archive › dc_d615e340e323
Transform before linearizing: robust Newton methods for singular $p$-Laplace and $p$-Stokes equations — arXiv:2609.12241
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.12241
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T03:44:27.833Z
- SHA-256 of the archived text
2f728b97790014d1ab9db986efa92fe4898dc6a44258ece867da08be49bc3aa0- Stable URL of this page
https://metraipolis.com/documento/dc_d615e340e323
How to cite
Transform before linearizing: robust Newton methods for singular $p$-Laplace and $p$-Stokes equations — arXiv:2609.12241 — arXiv (en), https://arxiv.org/abs/2609.12241 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d615e340e323 (Metraipolis archive dc_d615e340e323, sha256 2f728b97790014d1ab9db986efa92fe4898dc6a44258ece867da08be49bc3aa0)
BibTeX
@misc{dcd615e340e323,
title = {Transform before linearizing: robust Newton methods for singular $p$-Laplace and $p$-Stokes equations — arXiv:2609.12241},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.12241},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d615e340e323; sha256 2f728b97790014d1ab9db986efa92fe4898dc6a44258ece867da08be49bc3aa0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12241. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For $1<p<2$, the $p$-Laplace equation and its $p$-Stokes generalization are difficult to solve numerically. Newton's method converges rapidly only close to the solution, with iteration counts that grow under mesh refinement and deteriorate as $p\to1$. The more robust Picard iteration converges only linearly. Rather than globalizing or preconditioning Newton's method, we modify the system to which it is applied. We \emph{lift} the equation by introducing the flux $|\nabla u|^{p-2}\nabla u$ as an auxiliary (or ''lifting'') variable, apply a nonlinear \emph{transformation} to the resulting constitutive relation, \emph{linearize}, and \emph{eliminate} the auxiliary variable by static condensation. Lifting alone leaves the linearization unchanged; it is the preceding transformation that yields the new method. The elimination is algebraic and pointwise at the quadrature points, so the flux variable is never discretized, no inf-sup condition or indefinite system arises, and the cost per iteration is that of a standard Newton step. Together with a pointwise feasibility bound on the lifting variable that keeps the diffusion tensor uniformly positive definite, this yields an iteration that we prove, in finite dimensions and for the $p$-Laplace equation, to converge globally and locally at a quadratic rate; a one-dimensional model problem explains why the lagged flux variable removes the zig-zag behavior of standard Newton for $p$ close to one. Firedrake-based experiments for $p$-Laplace problems in two and three dimensions and for stationary and time-dependent $p$-Stokes flows show iteration counts largely insensitive to $p$ and to mesh refinement, and up to an order of magnitude fewer iterations than standard Newton for $p$ close to one.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-14 in math.OC).
Categorie arXiv: Numerical Analysis (math.NA) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.12241 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T03:15:38.825Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).