Smoother is the most important component of parallel multigrid methods, however, the widely used Gauss-Seidel smoother is difficult to be parallelized. This paper proposes a new parallel smoother, Jacobi-type Gauss-Seidel with error compensa-tion(JGSEC), by compensating the error caused by Jacobi-type Gauss-Seidel(JGS) smoother. Requiring no more inter-processor communication than JGS, JGSEC can eliminate the main part (more than ninety-five percent) of error arising from JGS at cost of a little more work amount. Numerical experiment has verified the good performance of JGSEC
In the paper, the parallelization of multi-grid methods for solving second-order elliptic boundary v...
Abstract. The aim of this paper is to study some iterative methods for solving Partial Differential ...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
Gauss-Seidel is a popular multigrid smoother as it is provably optimal on structured grids and exhib...
Efficient solution of partial differential equations require a match between the algorithm and the t...
Gauss–Seidel is often the smoother of choice within multigrid applications. In the context of unstru...
Efficient solution of partial differential equations require a match between the algorithm and the t...
This paper proposes and analyzes a class of multigrid smoothers called the parallel multiplicative (...
Multigrid (MG) methods are known to be fast linear solvers for large-scale finite element analyses. ...
: A new relaxation analysis and two acceleration schemes are proposed for the five-point Red-Black G...
Multigrid algorithms are widely used to solve large-scale sparse linear systems, which is essential ...
Finite Element problems are often solved using multigrid techniques. The most time consuming part of...
A straightforward implicit smoothing method implemented in several codes solving the Reynolds-averag...
AbstractThis paper explores the need for asynchronous iteration algorithms as smoothers in multigrid...
This paper explores the need for asynchronous iteration algorithms as smoothers in multigrid methods...
In the paper, the parallelization of multi-grid methods for solving second-order elliptic boundary v...
Abstract. The aim of this paper is to study some iterative methods for solving Partial Differential ...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...
Gauss-Seidel is a popular multigrid smoother as it is provably optimal on structured grids and exhib...
Efficient solution of partial differential equations require a match between the algorithm and the t...
Gauss–Seidel is often the smoother of choice within multigrid applications. In the context of unstru...
Efficient solution of partial differential equations require a match between the algorithm and the t...
This paper proposes and analyzes a class of multigrid smoothers called the parallel multiplicative (...
Multigrid (MG) methods are known to be fast linear solvers for large-scale finite element analyses. ...
: A new relaxation analysis and two acceleration schemes are proposed for the five-point Red-Black G...
Multigrid algorithms are widely used to solve large-scale sparse linear systems, which is essential ...
Finite Element problems are often solved using multigrid techniques. The most time consuming part of...
A straightforward implicit smoothing method implemented in several codes solving the Reynolds-averag...
AbstractThis paper explores the need for asynchronous iteration algorithms as smoothers in multigrid...
This paper explores the need for asynchronous iteration algorithms as smoothers in multigrid methods...
In the paper, the parallelization of multi-grid methods for solving second-order elliptic boundary v...
Abstract. The aim of this paper is to study some iterative methods for solving Partial Differential ...
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, i...