The symmetric V-cycle can diverge under the multigrid axioms for cell-centred discretisations
Abstract
The axiomatic convergence theory for multigrid methods applied to cell-centred finite-difference and finite-volume discretisations rests on two hypotheses: an imbalanced Galerkin condition (G3), which states that with , and a weak approximation property of Bramble type. Under these hypotheses, together with Richardson smoothing, the symmetric W-cycle and the variable V-cycle are known to be uniformly convergent, while the uniform convergence of the standard symmetric V-cycle has remained open. We answer this in the negative by two constructions. First, for every smoothing count we exhibit hierarchies of every depth satisfying (G3), Richardson admissibility with , and for every with the sharp level-independent constant , whose symmetric -cycle error operator has spectral radius already on three levels, where , and growing geometrically with the depth; the family shows that any smoothing-count threshold that could restore uniform V-cycle convergence must grow at least quadratically in . Second, we prove that the same failure occurs in a completely standard discretisation: the cell-centred finite-volume hierarchy for a one-dimensional diffusion equation with a mesh-aligned coefficient jump and harmonic (Samarskii) interface averaging satisfies (G3) exactly and with a level-independent constant , yet for every its symmetric -cycle with any admissible Richardson parameter, including the optimal one, diverges geometrically in the number of levels. In both constructions the W-cycle remains uniformly contractive, so the hypotheses separate the two cycles. All claims are verified numerically.
Keywords
Cite
@article{arxiv.2607.23391,
title = {The symmetric V-cycle can diverge under the multigrid axioms for cell-centred discretisations},
author = {Ming Hei Wong},
journal= {arXiv preprint arXiv:2607.23391},
year = {2026}
}
Comments
26 pages, 6 figures