Combining the Augmented Lagrangian Preconditioner withe the SIMPLE Schur Complement Approximation

Journal Article (2018)
Author(s)

X. He (Chinese Academy of Sciences)

Cornelis Vuik (TU Delft - Numerical Analysis)

C.M. Klaij (Maritime Research Institute Netherlands (MARIN))

Research Group
Numerical Analysis
Copyright
© 2018 X. He, Cornelis Vuik, Christiaan M. Klaij
DOI related publication
https://doi.org/10.1137/17M1144775
More Info
expand_more
Publication Year
2018
Language
English
Copyright
© 2018 X. He, Cornelis Vuik, Christiaan M. Klaij
Research Group
Numerical Analysis
Issue number
3
Volume number
40
Pages (from-to)
1362-1385
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

The augmented Lagrangian (AL) preconditioner and its variant have been successfully applied to solve saddle point systems arising from the incompressible Navier-Stokes equations discretized by the finite element method. Attractive features are the purely algebraic construction and robustness with respect to the Reynolds number and mesh renement. In this report, we reconsider the application of the AL preconditioner in the context of the stabilized finite volume methods and present the extension to the
Reynolds-Averaged Navier-Stokes (RANS) equations, which are used to model turbulent flows in industrial applications. Furthermore, we propose a new variant of the AL preconditioner, obtained by substituting the approximation of the Schur complement from the SIMPLE preconditioner into the inverse of the Schur complement for the AL preconditioner. This new variant is applied to both Navier-Stokes and RANS equations to compute laminar and turbulent boundary-layer flows on grids with large aspect ratios. Spectral analysis shows that the new variant yields a more clustered spectrum of eigenvalues away from zero, which explains why it outperforms the existing variants in terms of the number of the Krylov subspace iterations.

Files

17m1144775.pdf
(pdf | 1.18 Mb)
License info not available