arXiv · 2403.04702
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 \begin{equation} \left\{ \begin{array} [c]{cc} Step\ 1: & -\triangle u^{n+1}+\nabla p^{n}=f(x),\ {\rm in}\ Ω,\ u^{n+1}|_{\partialΩ}=0,\\ Step\ 2: & p^{n+1}-p^{n}+β\nabla\cdot(u^{n+1}-u^{n})+α^{2}\nabla\cdot u^{n+1}=0. \end{array} \right. \end{equation} For saddle point problems, including Stokes, this iteration converges under a condition similar to the one required for Uzawa iteration.
Explore related subjects
Keep this discovery
Aytekin Çibik, William Layton. 2024-04-13. Convergence of a Ramshaw-Mesina Iteration. https://doi.org/10.1016/j.aml.2024.109107
Cite the original work for its findings. Save a collection to share your selection of sources.
Discover connections
Connections use source metadata and explicit phrase matches, not verified experimental comparisons.