The multigrid V-cycle methods for adaptive finite element discretizations of two-dimensional elliptic problems with discontinuous coefficients are considered. Under the conditions that the coefficient is quasi-monotone up to a constant and the meshes are locally refined by using the newest vertex bisection algorithm, some uniform convergence results are proved for the standard multigrid V-cycle algorithm with Gauss-Seidel relaxations performed only on new nodes and their immediate neighbours. The multigrid V-cycle algorithm uses O(N) operations per iteration and is optimal.
No takes yet. Share an insight, caveat, or question.
Wu et al. (2023) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: