Multigrid methods for a quad-curl problem based on C~0 interior penalty method

摘要

In this paper we study the multigrid algorithm for a quad-curl problem based on C-0 interior penalty method on bounded polygonal domains. It is shown that the contraction numbers of W-cycle multigrid algorithm for the C-0 interior penalty method converge uniformly with rate of m(-alpha), where m is the number of pre-smoothing (and post-smoothing) steps, alpha is the index of elliptic regularity. The performance of the multigrid fast solver is illustrated by numerical results. (C) 2018 Elsevier Ltd. All rights reserved.