AbstractIn multigrid methods, it is preferred to employ smoothing techniques which are convergent. In practice, the standard Jacobi and Gauss-Seidel methods are the choices for “smoothers” However, it is known that if the spectral radius condition is violated, then convergence is not guaranteed for these methods. In this paper we develop a simple two-step Jacobi-type method which has better convergence properties and which can be employed as a convergent “smoother” wherever the standard iterative methods fail. We provide the convergence proofs and demonstrate the applicability of the method on a variety of problems
AbstractA general class of iterative methods is introduced for solving positive definite linear syst...
Multigrid (MG) methods are known to be fast linear solvers for large-scale finite element analyses. ...
Multigrid methods applied to standard linear finite element discretizations of linear elliptic bound...
AbstractIn multigrid methods, it is preferred to employ smoothing techniques which are convergent. I...
The convergence analysis on the general iterative methods for the symmetric and positive semidefinit...
AbstractMulti-stage versions of Jacobi relaxation are studied for use in multigrid methods for stead...
AbstractMulti-stage versions of Jacobi relaxation are studied for use in multigrid methods for stead...
Abstract. About thirty years ago, Achi Brandt wrote a seminal paper providing a convergence theory f...
AbstractThe Jacobi–Davidson method is known to converge at least quadratically if the correction equ...
[[abstract]]In this paper, a Second degree generalized Jacobi Iteration method for solving system of...
AbstractIn this paper, we present the convergence analysis for some modified Gauss–Seidel and Jacobi...
AbstractSome comparison results between Jacobi iterative method with the modified preconditioned sim...
The Jacobi–Davidson method is known to converge at least quadratically if the correction equation is...
The Jacobi–Davidson method is known to converge at least quadratically if the correction equation is...
In this note we consider discrete linear reaction-diffusion problems. For the discretization a stand...
AbstractA general class of iterative methods is introduced for solving positive definite linear syst...
Multigrid (MG) methods are known to be fast linear solvers for large-scale finite element analyses. ...
Multigrid methods applied to standard linear finite element discretizations of linear elliptic bound...
AbstractIn multigrid methods, it is preferred to employ smoothing techniques which are convergent. I...
The convergence analysis on the general iterative methods for the symmetric and positive semidefinit...
AbstractMulti-stage versions of Jacobi relaxation are studied for use in multigrid methods for stead...
AbstractMulti-stage versions of Jacobi relaxation are studied for use in multigrid methods for stead...
Abstract. About thirty years ago, Achi Brandt wrote a seminal paper providing a convergence theory f...
AbstractThe Jacobi–Davidson method is known to converge at least quadratically if the correction equ...
[[abstract]]In this paper, a Second degree generalized Jacobi Iteration method for solving system of...
AbstractIn this paper, we present the convergence analysis for some modified Gauss–Seidel and Jacobi...
AbstractSome comparison results between Jacobi iterative method with the modified preconditioned sim...
The Jacobi–Davidson method is known to converge at least quadratically if the correction equation is...
The Jacobi–Davidson method is known to converge at least quadratically if the correction equation is...
In this note we consider discrete linear reaction-diffusion problems. For the discretization a stand...
AbstractA general class of iterative methods is introduced for solving positive definite linear syst...
Multigrid (MG) methods are known to be fast linear solvers for large-scale finite element analyses. ...
Multigrid methods applied to standard linear finite element discretizations of linear elliptic bound...