Note on the multigrid \(W\)-cycle (Q1375456): Difference between revisions

The note presents a theorem which shows the equivalence of two multigrid algorithms. Both of them solve sparse linear systems by the multigrid \(W\)-cycle implemented with Galerkin schemes. It is shown that the above equivalence is based on the fact that the recalculation of the fine-level residual in the middle of the classical \(W\)-cycle can be deleted.