A hybrid geometric + algebraic multigrid method with semi‐iterative smoothers. Issue 2 (March 2014)

• Record Type: Journal Article
• Authors: Lu, Cao; Jiao, Xiangmin; Missirlis, Nikolaos
• Is Part Of: Numerical linear algebra with applications. Volume 21:Issue 2(2014:Mar.)
• Page Start: 221
• Page End: 238
• Publication Date: 2014-03
• Subjects: Algebras, Linear -- Periodicals; 512.5
• DOI: 10.1002/nla.1925
• Languages: English
• ISSNs: 1070-5325

Abstract

<abstract abstract-type="main" id="nla1925-abs-0001"> <title>SUMMARY</title> <p id="nla1925-para-0001">We propose a multigrid method for solving large‐scale sparse linear systems arising from discretizations of partial differential equations, such as those from finite element and generalized finite difference methods. Our proposed method has the following two characteristics. First, we introduce a hybrid geometric+algebraic multigrid method, or <italic>HyGA</italic>, to leverage the rigor, accuracy, and efficiency of geometric multigrid (GMG) for hierarchical unstructured meshes, with the flexibility of algebraic multigrid (AMG). Second, we introduce efficient smoothers based on the Chebyshev–Jacobi method for both symmetric and asymmetric matrices. We also introduce a unified derivation of restriction and prolongation operators for weighted‐residual formulations over unstructured hierarchical meshes and apply it to both finite element and generalized finite difference methods. We present numerical results of our method for Poisson equations in both 2‐D and 3‐D and compare our method against the classical GMG and AMG as well as Krylov subspace methods. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>