Nonsymmetric Black Box Multigrid with Coarsening by Three

Yavneh, Irad; Weinzierl, Marion

Abstract

The classical Petrov–Galerkin approach to Black Box multigrid for nonsymmetric problems due to Dendy is combined with the recent factor-three-coarsening Black Box algorithm due to Dendy and Moulton, along with a powerful symmetric line Gauss–Seidel smoother, resulting in an efficient and robust multigrid solver. Focusing on the convection–diffusion operator, the algorithm is tested and shown to achieve fast and reliable convergence with both first-order and second-order accurate upstream discretizations of the convection operator. The solver also exhibits robust behavior with respect to discontinuous jumps in the diffusion coefficient and performs well for recirculating flows over a wide range of diffusion coefficients. The efficiency of the solver is supported by results of an analysis for the case of constant coefficients. Copyright © 2012 John Wiley & Sons, Ltd.

Citation

Yavneh, I., & Weinzierl, M. (2012). Nonsymmetric Black Box Multigrid with Coarsening by Three. Numerical Linear Algebra with Applications, 19(2), 246-262

• Journal Article Type: Article
• Acceptance Date: Dec 7, 2011
• Online Publication Date: Jan 8, 2012
• Publication Date: 2012-03
• Deposit Date: Dec 15, 2014
• Journal: Numerical Linear Algebra with Applications
• Print ISSN: 1070-5325
• Publisher: Wiley
• Peer Reviewed: Peer Reviewed
• Volume: 19
• Issue: 2
• Pages: 246-262
• Public URL: https://durham-repository.worktribe.com/output/1448179