Convergence of a Ramshaw-Mesina Iteration

Abstract

In 1991 Ramshaw and Mesina introduced a clever synthesis of penalty methods and artificial compression methods. Its form makes it an interesting option to replace the pressure update in the Uzawa iteration. The result, for the Stokes problem, is equation \ array [c]cc Step\ 1: & - un+1+∇ pn=f(x),\ in\ ,\ un+1|∂=0,\\ Step\ 2: & pn+1-pn+β∇·(un+1-un)+α 2∇· un+1=0. array . equation For saddle point problems, including Stokes, this iteration converges under a condition similar to the one required for Uzawa iteration.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…