Hierarchical proximal Galerkin: A fast hp--FEM solver for variational problems with pointwise inequality constraints
Authors
- Papadopoulos, Ioannis
ORCID: 0000-0003-3522-8761
2020 Mathematics Subject Classification
- 35J86 35R35 49J40 49M41 65K10 65K15 65N30
Keywords
- Obstacle problem, gradient-type constraints, latent variable proximal point, hp-FEM
DOI
Abstract
We leverage the proximal Galerkin algorithm (Keith and Surowiec, Foundations of Computational Mathematics, 2024), a recently introduced mesh-independent algorithm, to obtain a high-order finite element solver for variational problems with pointwise inequality constraints. This is achieved by discretizing the saddle point systems, arising from the latent variable proximal point method, with the hierarchical p-finite element basis. This results in discretized sparse Newton systems that admit a simple and effective block preconditioner. The solver can handle both obstacle-type and gradient-type constraints. We apply the resulting algorithm to solve obstacle problems with hp-adaptivity, a gradient-type constrained problem, and the thermoforming problem, an example of an obstacle-type quasi-variational inequality. We observe hp-robustness in the number of Newton iterations and only mild growth in the number of inner Krylov iterations to solve the Newton systems. Crucially we also provide wall-clock timings that are faster than low-order discretization counterparts.
Download Documents