We propose and analyze a Vanka-type multigrid solver for solving a sequence of complex-
shifted Laplacian systems arising in diagonalization-based parallel-in-time algorithms for …

In this work, we propose three novel block-structured multigrid relaxation schemes based on
distributive relaxation, Braess–Sarazin relaxation, and Uzawa relaxation, for solving the …

In recent years, solvers for finite-element discretizations of linear or linearized saddle-point
problems, like the Stokes and Oseen equations, have become well established. There are …

In this work, a local Fourier analysis is presented to study the convergence of multigrid
methods based on additive Schwarz smoothers. This analysis is presented as a general …

In this work, we propose 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. In …

In this paper we propose and analyze new efficient sparse approximate inverse (SAI)
smoothers for solving the two-dimensional (2D) and three-dimensional (3D) Laplacian linear …

In this work, we propose 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. In …

In this paper we study and compare two multigrid relaxation schemes with coarsening by
two, three, and four for solving elliptic sparse optimal control problems with control …

Large linear systems of saddle-point type have arisen in a wide variety of applications
throughout computational science and engineering. The discretizations of distributed control …

We consider a block‐structured multigrid method based on Braess–Sarazin relaxation for
solving the Stokes–Darcy Brinkman equations discretized by the marker and cell scheme. In …