h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems

被引:19
作者
Botti, L. [1 ]
Colombo, A. [1 ]
Bassi, F. [1 ]
机构
[1] Univ Bergamo, Dipartimento Ingn & Sci Appl, Via Marconi 4, I-24044 Dalmine, BG, Italy
关键词
Multigrid; Agglomeration; Discontinuous Galerkin; Incompressible flow problems; Polyhedral elements; NAVIER-STOKES EQUATIONS; DOMAIN DECOMPOSITION PRECONDITIONERS; ARTIFICIAL COMPRESSIBILITY FLUX; ELLIPTIC PROBLEMS; COMPLICATED DOMAINS; PSEUDOTRANSIENT CONTINUATION; EULER EQUATIONS; ALGORITHMS; MESHES;
D O I
10.1016/j.jcp.2017.07.002
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this work we exploit agglomeration based h-multigrid preconditioners to speed-up the iterative solution of discontinuous Galerkin discretizations of the Stokes and Navier-Stokes equations. As a distinctive feature h-coarsened mesh sequences are generated by recursive agglomeration of a fine grid, admitting arbitrarily unstructured grids of complex domains, and agglomeration based discontinuous Galerkin discretizations are employed to deal with agglomerated elements of coarse levels. Both the expense of building coarse grid operators and the performance of the resulting multigrid iteration are investigated. For the sake of efficiency coarse grid operators are inherited through element-by-element L-2 projections, avoiding the cost of numerical integration over agglomerated elements. Specific care is devoted to the projection of viscous terms discretized by means of the BR2 dG method. We demonstrate that enforcing the correct amount of stabilization on coarse grids levels is mandatory for achieving uniform convergence with respect to the number of levels. The numerical solution of steady and unsteady, linear and non-linear problems is considered tackling challenging 2D test cases and 3D real life computations on parallel architectures. Significant execution time gains are documented. (c) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:382 / 415
页数:34
相关论文
共 51 条
  • [1] [Anonymous], 2004, Report
  • [2] An image-based modeling framework for patient-specific computational hemodynamics
    Antiga, Luca
    Piccinelli, Marina
    Botti, Lorenzo
    Ene-Iordache, Bogdan
    Remuzzi, Andrea
    Steinman, David A.
    [J]. MEDICAL & BIOLOGICAL ENGINEERING & COMPUTING, 2008, 46 (11) : 1097 - 1112
  • [3] Antonietti P., 2012, Comput. Methods Appl. Math, V12, P241, DOI DOI 10.2478/CMAM-2012-0021
  • [4] Antonietti P.F., 2017, CALCOLO IN PRESS
  • [5] Antonietti PF, 2016, INT J NUMER ANAL MOD, V13, P513
  • [6] MULTIGRID ALGORITHMS FOR hp-DISCONTINUOUS GALERKIN DISCRETIZATIONS OF ELLIPTIC PROBLEMS
    Antonietti, Paola F.
    Sarti, Marco
    Verani, Marco
    [J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 2015, 53 (01) : 598 - 618
  • [7] Domain Decomposition Preconditioners for Discontinuous Galerkin Methods for Elliptic Problems on Complicated Domains
    Antonietti, Paola F.
    Giani, Stefano
    Houston, Paul
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2014, 60 (01) : 203 - 227
  • [8] hp-VERSION COMPOSITE DISCONTINUOUS GALERKIN METHODS FOR ELLIPTIC PROBLEMS ON COMPLICATED DOMAINS
    Antonietti, Paola F.
    Giani, Stefano
    Houston, Paul
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2013, 35 (03) : A1417 - A1439
  • [9] Unified analysis of discontinuous Galerkin methods for elliptic problems
    Arnold, DN
    Brezzi, F
    Cockburn, B
    Marini, LD
    [J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 2002, 39 (05) : 1749 - 1779
  • [10] Balay S, 1997, MODERN SOFTWARE TOOLS FOR SCIENTIFIC COMPUTING, P163