Many applications in fluid mechanics require the numerical solution of sequences of linear systems typically issued from finite element discretization of the Navier-Stokes equations. The resulting matrices then exhibit a saddle point structure. To achieve this task, a Newton-based root-finding algorithm is usually employed which in turn necessitates to solve a saddle point system at every Newton iteration. The involved linear systems being large scale and ill-conditioned, effective linear solvers must be implemented. Here, we develop and test several methods for solving the saddle point systems, considering in particular the LU factorization, as direct approach, and the preconditioned generalized minimal residual (ΡGMRES) solver, an iterative approach. We apply the various solvers within the root-finding algorithm for Flow over backward facing step systems. The particularity of Flow over backward facing step system is an interesting case for studying the performance and solution strategy of a turbulence model. In this case, the flow is subjected to a sudden increase of cross-sectional area, resulting in a separation of flow starting at the point of expansion, making the system of differential equations particularly stiff. We assess the performance of the direct and iterative solvers in terms of computational time, numbers of Newton iterations and time steps.
展开▼
