Related papers: Smoothing analysis of two robust multigrid methods…
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…
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 problems have a saddle-point structure. The numerical…
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 Stokes equations discretized by the mark-and-cell scheme.…
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 [21], local Fourier analysis has been applied to a…
The Scheduled Relaxation Jacobi (SRJ) method is an extension of the classical Jacobi iterative method to solve linear systems of equations ($Au=b$) associated with elliptic problems. It inherits its robustness and accelerates its…
The Scheduled Relaxation Jacobi (SRJ) method is a viable candidate as a high performance linear solver for elliptic partial differential equations (PDEs). The method greatly improves the convergence of the standard Jacobi iteration by…
The Scheduled Relaxation Jacobi (SRJ) method is a linear solver algorithm which greatly improves the convergence of the Jacobi iteration through the use of judiciously chosen relaxation factors (an SRJ scheme) which attenuate the solution…
In this paper, we develop a local Fourier analysis of multigrid methods based on block-structured relaxation schemes for stable and stabilized mixed finite-element discretizations of the Stokes equations, to analyze their convergence…
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 framework which allows us to study these smoothers for any type…
Algebraic multigrid (AMG) methods derive their optimal efficiency from the interplay between a relaxation process and a corresponding coarse grid correction. In many standard formulations, relaxation and coarse-graining are analyzed and…
We consider the numerical solution of Poisson's equation on structured grids using geometric multigrid with nonstandard coarse grids and coarse level operators. We are motivated by the problem of developing high-order accurate numerical…
Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in various applications. In this paper, we consider StQPs with a hard sparsity constraint, referred to as sparse StQPs. We focus on various tractable convex…
During the last decade, Neural Networks (NNs) have proved to be extremely effective tools in many fields of engineering, including autonomous vehicles, medical diagnosis and search engines, and even in art creation. Indeed, NNs often…
Iteratively reweighted least square (IRLS) is a popular approach to solve sparsity-enforcing regression problems in machine learning. State of the art approaches are more efficient but typically rely on specific coordinate pruning schemes.…
We propose a block-structured multigrid relaxation scheme for solving the Stokes-Darcy Brinkman equations discretized by the marker and cell scheme. An element-based additive Vanka smoother is used to solve the corresponding shifted…
Elliptic partial differential equations (ePDEs) appear in a wide variety of areas of mathematics, physics and engineering. Typically, ePDEs must be solved numerically, which sets an ever growing demand for efficient and highly parallel…
Smoothing properties of two-color distributive relaxation for solving a two-dimensional (2D) Stokes flow by multigrid method are theoretically investigated by using the local Fourier analysis (LFA) method. The governing equation of the 2D…
We focus on the study of multigrid methods with aggressive coarsening and polynomial smoothers for the solution of the linear systems corresponding to finite difference/element discretizations of the Laplace equation. Using local Fourier…
We present a comparison of different multigrid approaches for the solution of systems arising from high-order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the…
In this paper a local Fourier analysis for multigrid methods on tetrahedral grids is presented. Different smoothers for the discretization of the Laplace operator by linear finite elements on such grids are analyzed. A four-color smoother…