Sunden CH005.tex 10/9/2010 15: 0 Page 194
194 Computational Fluid Dynamics and Heat Transfer
the price of complicated formulation and possible less solution robustness due to
velocity–pressure decoupling (addressed later).
The secondcategorization is basedon the mixed-order interpolation andequal-
orderinterpolationaccordingtotheordersofinterpolationfunctionsforthevelocity
and pressure in element level.The mixed-order interpolation attempts to eliminate
the tendency to produce checkerboard pressure pattern and to satisfy LBB condi-
tion; the velocity in this method is interpolated linearly, whereas the pressure is
assumed to be constant; this interpolation is referred to as Q1P0. The equal-order
interpolationin Ref. [5]useslinear interpolation forvelocity–pressureformulation
(referred to as Q1P1) without exhibiting spurious pressure modes, by employing
nonconsistent pressure equations (NCPEs) for pressure correction. This method
makes the solver more effective than constant element pressure in an element for
Q1P0 method.
Theobjectiveofthischapter istoexplorefurtherthemeritsofthefinite-element
methods in simulating the flow where the upstream effects play important roles.
Thus, we are presenting the details of making use of both the segregated velocity–
pressure and equal-order formulations on the basis of SUPG method.
The basic idea of segregated algorithms is to decouple the pressure calculation
from the velocity calculation by taking the divergence of the vector momentum
equation and applying some clever insights regarding incompressible flow. Early
motivationforthisapproachwaslargelytwofold: tomitigatememoryrequirements
of fully coupled algorithms and to enable semi-implicit time integration.
Pressure–velocity segregation methods have been reviewed by several
researchersin thecontextofthefinite-element method; mostnotableare thepapers
by Gresho and Haroutunian et al. [2]. Basically, all current segregated algorithm
variants are distinguished by the way in which the pressure is decoupled and pro-
jectedfromonetimesteptothenext.HaroutunianandEngelman[2]proposedthree
consistent finite-element counterparts to the SIMPLE and SIMPLER algorithm.
To further reduce the size of the submatrix systems, each individual component
of the momentum equations was solved separately and successively by iterative
techniques. Overall at each Newton iteration or Picard iteration they solved four
matrix subsystems, one for each of three velocity components and one for the
pressure. Interestingly, the most challenging matrix system to solve happens to be
one arising from the discretization of the pressure equation; here, the right-hand
side SF
4
in equation (5.43) is lagged from the last iteration so that this equation
is solved solely for the pressure. The resulting matrix, despite being symmet-
ric, is actually very poorly conditioned due to poor scaling. Nonetheless, these
challenging matrix systems can be readily solved by modern iterative solvers and
reordering/preconditioner strategies, andthesuccess of this algorithm over thelast
decade has been enormous.
In our view this approach is still a compromise to the favorable convergence
properties ofafullycoupledtechnique advocated here.Convergencetostablesolu-
tions at successive time steps is linear at best case and sometimes asymptotic,
sometimes resulting in large number of required segregation iterations (albeit fast
iterations). Moreover, the method introduces several relaxation parameters that