Preconditioning proximal Galerkin: mesh and degree robust solvers for variational inequalities
The proximal Galerkin algorithm is a structure-preserving solver for variational inequalities that results in discretization-independent nonlinear iteration counts. However, in large three-dimensional simulations, the arising Newton saddle point systems cannot be feasibly solved by direct methods. To leverage an iterat...