AbstractTo estimate convergence of the multigrid algorithms, we need some assumptions on smoothers. The assumptions for typical smoothers are well analyzed in the multigrid literature [1,2]. However, numerical evidence shows that Kaczmarz smoother does not satisfy above assumptions. Thus, we introduce a weaker condition which is satisfied by Kaczmarz smoother as well as Jacobi and Gauss-Seidel smoother. Under these weaker assumptions, we show that the convergence factor of V-cycle multigrid algorithm is δ = 1 − 1(C(j − 1)). assumptions for Kaczmarz smoother are verified by numerical experiment
In this paper possibilities to obtain a satisfactory multigrid convergence when a domain is partitio...
Multigrid methods applied to standard linear finite element discretizations of linear elliptic bound...
We make a brief algebraic survey of the highlights of the classical convergence theory for multigrid...
In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite ellip...
For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigri...
We generalise the abstract V-cycle convergence proof of [20] and [21] to include unsymmetric smoothi...
Based on the theory for multigrid methods with nonnested spaces and noninherited quadratic forms, a ...
summary:We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. W...
summary:We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. W...
Monotone iteration methods are preferable to solve linear or nonlinear systems of equations, because...
We consider multigrid methods with V-cycle for symmetric positive definite linear systems. We compar...
In this note we consider discrete linear reaction-diffusion problems. For the discretization a stand...
The solution of the singular perturbation problem by a multigrid algorithm is considered. Theoretica...
AbstractIn multigrid methods, it is preferred to employ smoothing techniques which are convergent. I...
Space-time multigrid refers to the use of multigrid methods to solve discretized partial differentia...
In this paper possibilities to obtain a satisfactory multigrid convergence when a domain is partitio...
Multigrid methods applied to standard linear finite element discretizations of linear elliptic bound...
We make a brief algebraic survey of the highlights of the classical convergence theory for multigrid...
In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite ellip...
For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigri...
We generalise the abstract V-cycle convergence proof of [20] and [21] to include unsymmetric smoothi...
Based on the theory for multigrid methods with nonnested spaces and noninherited quadratic forms, a ...
summary:We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. W...
summary:We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. W...
Monotone iteration methods are preferable to solve linear or nonlinear systems of equations, because...
We consider multigrid methods with V-cycle for symmetric positive definite linear systems. We compar...
In this note we consider discrete linear reaction-diffusion problems. For the discretization a stand...
The solution of the singular perturbation problem by a multigrid algorithm is considered. Theoretica...
AbstractIn multigrid methods, it is preferred to employ smoothing techniques which are convergent. I...
Space-time multigrid refers to the use of multigrid methods to solve discretized partial differentia...
In this paper possibilities to obtain a satisfactory multigrid convergence when a domain is partitio...
Multigrid methods applied to standard linear finite element discretizations of linear elliptic bound...
We make a brief algebraic survey of the highlights of the classical convergence theory for multigrid...