Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Parameter-robust Braess-Sarazin-type smoothers for linear elasticity problems (2204.10462v1)

Published 22 Apr 2022 in math.NA and cs.NA

Abstract: In this work, we propose three Braess-Sarazin-type multigrid relaxation schemes for solving linear elasticity problems, where the marker and cell scheme, a finite difference method, is used for the discretization. The three relaxation schemes are Jacobi-Braess-Sarazin, Mass-Braess-Sarazin, and Vanka-Braess-Sarazin. A local Fourier analysis (LFA) for the block-structured relaxation schemes is presented to study multigrid convergence behavior. From LFA, we derive optimal LFA smoothing factor for each case. We obtain highly efficient smoothing factors, which are independent of Lam\'{e} constants. Vanka-Braess-Sarazin relaxation scheme leads to the most efficient one. In each relaxation, a Schur complement system needs to be solved. Due to the fact that direct solve is often expensive, an inexact version is developed, where we simply use at most three weighted Jacobi iterations on the Schur complement system. Finally, two-grid and V-cycle multigrid performances are presented to validate our theoretical results. Our numerical results show that inexact versions can achieve the same performance as that of exact versions and our methods are robust to the Lam\'{e} constants.

Citations (1)

Summary

We haven't generated a summary for this paper yet.