The Analysis of Smoothers for Multigrid Algorithms

From MaRDI portal
Publication:4024671





The authors define and analyze smoothing operators for use in multigrid methods. The smoothing operators considered are based on subspace decomposition and include point, line and block versions of Jacobi and Gauss-Seidel iteration as well as generalizations. It is shown, that these smoothers will be effective in multigrid algorithms provided that the subspace decomposition satisfies two simple conditions, which may be trivial to verify in many applications.




Cited in
(58)








This page was built for publication: The Analysis of Smoothers for Multigrid Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024671)