A scalable solution strategy for high-order stabilized finite-element solvers using an implicit line preconditioner

• Published in: Computer methods in applied mechanics and engineering Vol. 341; pp. 956 - 984
• Main Authors: Ahrabi, Behzad R., Mavriplis, Dimitri J.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.11.2018; Elsevier BV
• Subjects: Algorithms; Compressibility; Compressible flows; Computational fluid dynamics; Computer simulation; Discretization; Factorization; Finite element analysis; Finite element method; Galerkin method; High-order methods; Implicit line smoothing; Linear systems; Linearization; Mathematical analysis; Mathematical models; Reynolds averaged Navier-Stokes method; Reynolds equation; Robustness (mathematics); Scalable algorithms; Simulation; Solvers; Stabilized finite-element methods; Time integration; Turbulence; Turbulent flows; Unstructured grids (mathematics); Implicit line smoothing; Stabilized finite-element methods; High-order methods; Scalable algorithms; Compressible flows; Turbulent flows
• ISSN: 0045-7825; 1879-2138
• DOI: 10.1016/j.cma.2018.07.026

This paper presents a robust, efficient, and strongly scalable solution methodology for simulation of complex turbulent flows on unstructured grids. The compressible Reynolds averaged Navier–Stokes (RANS) equations and the negative Spalart–Allmaras (SA) turbulence model are discretized, in coupled form, using a Streamline Upwind Petrov–Galerkin (SUPG) scheme. The time integration is fully implicit, and the discretized equations are advanced towards a steady-state solution using a pseudo-transient continuation (PTC). For solution of the linearized systems, a preconditioned Krylov solver is used. Seeking robustness, Krylov solvers are commonly preconditioned using incomplete factorization methods such as ILU(k). However, these methods are neither memory efficient, nor strongly scalable. To provide a better alternative, the implicit line solution method, which has been traditionally used in finite-volume methods, is revised and enhanced to solve stiffer linear systems. In the developed method, the lines are generated using a matrix-based approach, which connects the strongly-coupled unknowns. In addition, to improve the robustness of the line solver for high-CFL systems, a dual-CFL strategy, with a lower CFL number in the preconditioner matrix, is developed. Also, it is shown that for high-order continuous finite-element discretizations, the interconnections of the degrees of freedom on a line form a banded matrix which is wider than tridiagonal, but still can be factorized completely without generating any fill-ins. The developed line preconditioner is strongly scalable and, in contrast to the ILU factorization, its convergence behavior does not depend on the number of partitions. Two three-dimensional numerical examples are presented in which the performance of the line preconditioner is compared with that of the ILU(k) preconditioner. This comparison shows that, in addition to robustness improvements, the line preconditioner offers significant benefits in terms of memory efficiency.