arXiv (All)
open access
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. T
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An inherent regularization approach to parameter-free preconditioning for nearly incompressible linear poroelasticity#1296360
- On the Choice of Continuous and Discontinuous Lagrange Multipliers in Fictitious-Domain Methods#1187945
- Error Estimates for the Interpolation and Approximation of Gradients and Vector Fields on Protected Delaunay Meshes in $\mathbb {R}^{d}$#1134149
- Dimensional hyperreduction of nonlinear finite element models via empirical cubature with manifold-adaptive weights#925435
- Dimensional hyperreduction of nonlinear finite element models via empirical cubature with manifold-adaptive weights#921199
Record · ID 1297943
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive