Parallel domain decomposition method for finite element approximation of 3D steady state non‐Newtonian fluids

Abstract

SummaryWe introduce a stabilized finite element method for the 3D non‐Newtonian Navier–Stokes equations and a parallel domain decomposition method for solving the sparse system of nonlinear equations arising from the discretization. Non‐Newtonian flow problems are, generally speaking, more challenging than Newtonian flows because the nonlinearities are not only in the convection term but also in the viscosity term, which depends on the shear rate. Many good iterative methods and preconditioning techniques that work well for the Newtonian flows do not work well for the non‐Newtonian flows. We employ a Galerkin/least squares finite element method, with stabilization parameters adjusted to count the non‐Newtonian effect, to discretize the equations, and the resulting highly nonlinear system of equations is solved by a Newton–Krylov–Schwarz algorithm. In this study, we apply the proposed method to some inelastic power‐law fluid flows through the eccentric annuli with inner cylinder rotation and investigate the robustness of the method with respect to some physical parameters, including the power‐law index and the Reynolds number ratios. We then report the superlinear speedup achieved by the domain decomposition algorithm on a computer with up to 512 processors. Copyright © 2015 John Wiley & Sons, Ltd.

A parallel implicit domain decomposition algorithm for the large eddy simulation of incompressible turbulent flows on 3D unstructured meshes

“…22,23 First, we triangulate the computational domain Ω by a conformal tetrahedral mesh  h = {K} with h K the diameter of the element K ∈  h . With this, the above-defined spaces (14) and (15) are approximated by finite-dimensional spaces spanned by continuous piecewise linear functions as follows:…”

“…NKS has been successfully applied to solve different kind of nonlinear problems, for example, PDE‐constrained optimization problems, fluid‐structure interaction problems, non‐Newtonian fluid problems, inverse source problems, and elasticity problems, and has shown good parallel scalability to thousands of processors. In this work, we extend the algorithm to solve the fully implicit 3D LES problems and to investigate the performance of NKS for an industrial application.…”

Efficient Parallel Simulation of Blood Flows in Abdominal Aorta

“…Specifically, the unsteady incompressible Navier-Stokes equations are discreterized by using a fully implicit backward Euler method in time and a stabilized P 1 -P 1 finite element method in space. The resulting system is then solved by a Newton-Krylov-Schwarz (NKS) algorithm, which is a highly effective method to deal with large-scale, sparse and strongly nonlinear systems (Shiu et al, 2015). The parallel scalability of the NKS is mostly dependent on the performance of the Schwarz preconditioner and the optimal choices of parameters in the preconditioner are typically problem-dependent.…”