Novel mass-based multigrid relaxation schemes for the Stokes equations

@article{He2023NovelMM,
  title={Novel mass-based multigrid relaxation schemes for the Stokes equations},
  author={Yunhui He},
  journal={ArXiv},
  year={2023},
  volume={abs/2111.04922}
}
  • Yunhui He
  • Published 9 November 2021
  • Computer Science
  • ArXiv

Figures and Tables from this paper

A Vanka-based parameter-robust multigrid relaxation for the Stokes-Darcy Brinkman problems

A block-structured multigrid relaxation scheme for solving the Stokes-Darcy Brinkman equations discretized by the marker and cell scheme is proposed and it is shown that using damping parameter one can achieve the same performance as that of an exact solve.

Optimal smoothing factor with coarsening by three for the MAC scheme for the Stokes equations

This work proposes a local Fourier analysis for multigrid methods with coarsening by a factor of three for the staggered finite-difference method applied to the Stokes equations, and derives theoretically optimal smoothing factors for this coARSening strategy.

Parameter-robust Braess-Sarazin-type smoothers for linear elasticity problems

Numerical results show that inexact versions of Braess-Sarazin-type multigrid relaxation schemes can achieve the same performance as that of exact versions and the methods are robust to the Lam´e constants.

Smoothing analysis of two robust multigrid methods for elliptic optimal control problems

Two multigrid relaxation schemes with coarsening by two, three, and four for solving elliptic sparse optimal control problems with control constraints are studied and a new mass-based Braess-Sarazin relaxation (BSR) scheme is proposed, proven to provide smaller smoothing factors than the CJR scheme.

A novel multigrid method for elliptic distributed control problems

  • Yunhui He
  • Computer Science
    J. Comput. Appl. Math.
  • 2023

References

SHOWING 1-10 OF 22 REFERENCES

Local Fourier analysis of block‐structured multigrid relaxation schemes for the Stokes equations

A local Fourier analysis of block‐structured relaxation schemes for the staggered finite‐difference discretization of the Stokes equations to analyze their convergence behavior and compare the efficiency of the presented algorithms with these parameters.

Multigrid Methods for the Stokes Equations using Distributive Gauss–Seidel Relaxations based on the Least Squares Commutator

An efficient multigrid method for finite element discretizations of the Stokes equations on both structured grids and unstructured grids and a distributive Gauss–Seidel relaxation as a smoother is shown to be very efficient and outperforms the popular block preconditioned Krylov subspace methods.

A new approach for solving stokes systems arising from a distributive relaxation method

It is shown that under high regularity of the Laplacian, the transformed system admits almost block‐lower triangular form.

A Multigrid Solver based on Distributive Smoother and Residual Overweighting for Oseen Problems

An efficient multigrid solver for the Oseen problems discretized by Marker and Cell (MAC) scheme on staggered grid is developed in this paper. Least squares commutator distributive Gauss-Seidel

Multi-grid methods for stokes and navier-stokes equations

SummaryIn the present paper we introduce transforming iterations, an approach to construct smoothers for indefinite systems. This turns out to be a convenient tool to classify several well-known

A Fast Solver for the Stokes Equations Using Multigrid with a UZAWA Smoother

A smoother of Uzawa type suitable for the solution of mixed problems by multigrid methods is proposed, and numerical experiments for the Stokes equations discretized through the M.A.C. scheme are reported.

Multigrid Solutions to Elliptic Flow Problems

A Simple and Efficient Segregated Smoother for the Discrete Stokes Equations

This work considers the multigrid solution of the generalized Stokes equations with a segregated Gauss--Seidel smoother based on a Uzawa-type iteration, and obtains an analytic bound on the smoothing factor showing uniform performance for a family of Stokes problems.

Low‐order preconditioning of the Stokes equations

This work shows that high‐quality preconditioners can also be derived for the Taylor–Hood discretization of the Stokes equations in much the same manner as well as verifying and compared against the measured multigrid performance.