Related papers: Towards Matrix-Free Patch Smoothers for the Stokes…
We consider the problem of iteratively solving large and sparse double saddle-point systems arising from the stationary Stokes-Darcy equations in two dimensions, discretized by the Marker-and-Cell (MAC) finite difference method. We analyze…
We consider a compressible Stokes problem in the quasi-stationary case coupled with a time dependent advection-diffusion equation with special emphasis on high viscosity contrast geophysical mantle convection applications. In space, we use…
A stable numerical solution of the steady Stokes problem requires compatibility between the choice of velocity and pressure approximation that has traditionally proven problematic for meshless methods. In this work, we present a…
A general local Fourier analysis for overlapping block smoothers on triangular grids is presented. This analysis is explained in a general form for its application to problems with different discretizations. This tool is demonstrated for…
Recently, Bai and Benzi proposed a class of regularized Hermitian and skew-Hermitian splitting methods (RHSS) iteration methods for solving the nonsingular saddle point problem. In this paper, we apply this method to solve the singular…
We construct mesh-independent and parameter-robust monolithic solvers for the coupled primal Stokes-Darcy problem. Three different formulations and their discretizations in terms of conforming and non-conforming finite element methods and…
We are interested in a fast solver for the Stokes equations, discretized with multi-patch Isogeometric Analysis. In the last years, several inf-sup stable discretizations for the Stokes problem have been proposed, often the analysis was…
Solving the Stokes equation by an optimal domain decomposition method derived algebraically involves the use of non standard interface conditions whose discretisation is not trivial. For this reason the use of approximation methods such as…
Solving the linear elasticity and Stokes equations by an optimal domain decomposition method derived algebraically involves the use of non standard interface conditions. The one-level domain decomposition preconditioners are based on the…
We construct solvers for an isogeometric multi-patch discretization, where the patches are coupled via a discontinuous Galerkin approach, which allows the consideration of discretizations that do not match on the interfaces. We solve the…
We present a mesh-independent and parameter-robust multigrid solver for the Scott-Vogelius discretisation of the nearly incompressible linear elasticity equations on meshes with a macro element structure. The discretisation achieves exact…
In the present paper we develop a new family of Virtual Elements for the Stokes problem on polygonal meshes. By a proper choice of the Virtual space of velocities and the associated degrees of freedom, we can guarantee that the final…
The Stokes equations play an important role in the incompressible flow simulation. In this paper, a novel divergence-free parametric mixed finite element method is proposed for solving three-dimensional Stokes equations on domains with…
A discontinuous viscosity coefficient makes the jump conditions of the velocity and normal stress coupled together, which brings great challenges to some commonly used numerical methods to obtain accurate solutions. To overcome the…
We present augmented Lagrangian Schur complement preconditioners and robust multigrid methods for incompressible Stokes problems with extreme viscosity variations. Such Stokes systems arise, for instance, upon linearization of nonlinear…
We prove a local smoothing result for the Schr\"odinger equation on a class of surfaces of revolution which have infinitely many trapped geodesics. Our main result is a local smoothing estimate with loss (compared to \cite{ChMe-lsm})…
Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods, but scalability can be an issue. To address this shortcoming, over a decade ago, Burer and Monteiro proposed to solve SDPs with few equality…
Design optimization and uncertainty quantification, among other applications of industrial interest, require fast or multiple queries of some parametric model. The Proper Generalized Decomposition (PGD) provides a separable solution, a…
We propose an adaptive multigrid preconditioning technology for solving linear systems arising from Discontinuous Petrov-Galerkin (DPG) discretizations. Unlike standard multigrid techniques, this preconditioner involves only trace spaces…
We develop a $ P $-multigrid solver to simulate locally preconditioned unsteady compressible Navier-Stokes equations at low Mach numbers with implicit high-order methods. Specifically, the high-order flux reconstruction/correction procedure…