On the convergence of iterated penalty methods for structure-preserving discretizations of saddle point problems
Abstract
We present new convergence estimates for the iterated penalty method applied to structure-preserving discretizations of linear generalized saddle point systems. The method may be viewed as an Uzawa iteration on an augmented Lagrangian formulation of the system. As a by-product, we obtain sharper stability estimates for penalized/perturbed saddle point problems. Three model finite element applications show agreement with the theory.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.