Parallel Computation of Compressible Flows for Implicit Schemes Without Sub-iteration and Modification of the Implicit Solver

  • Zi-Niu Wu
  • Hui Zou
Conference paper
Part of the Notes on Numerical Fluid Mechanics (NNFM) book series (NNFM, volume 78)


Parallel computation for fluid flow problems has become very useful in the end of the last century and will certainly be very popular in the 21st century for handling large scale problems. Implicit schemes are efficient for obtaining steady state solutions and for treating slowly unsteady flows. However, implicit schemes are not inherently parallel and their parallelization usually requires addtional iteration or modification of the implicit solvers. Thus the parallelization of implicit schemes is accessible only to experts specialized in parallization. In [9, 12], a parallel method based on grid overlapping was proposed for inviscid flow computation. This method requires no additional iterations at each time step, and nor modification of the implicit solver. In this paper we analyze and use this method for viscous flow computation. We conclude that optimal parallel efficiency corresponds to an overlapping width determined by CFL,and the results are similar to inviscid problems for a sufficiently large mesh Reynolds number.


Computational Fluid Dynamics Interface Condition Single Domain Mesh Point Implicit Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T.F. Chan and D. Goovearts, “Schwartz=Schur, overlapping versus non-overlapping domain decomposition”, Technical Reports, CAM 88–21, UCLA, 1988.Google Scholar
  2. [2]
    D. E. Keyes, “Domain decomposition: a bridge between nature and parallel computers”, ICASE Report No. 92–44 (1992).Google Scholar
  3. [3]
    A. Lerat, “Multidimensional centered schemes of the Lax-Wendroff type”, CFD Review 1995,J. Wiley, pp.124–140.Google Scholar
  4. [4]
    A. Lerat and J. Sides, “Numerical simulation of unsteady transonic flows using the Euler equations in intcgeral form”, Israel Journal of Technology, 17, 302–310 (1979).zbMATHGoogle Scholar
  5. [5]
    P.L. Roe, “Approximate Riemann Solvers: Parameter vector and difference schemes”, J. Comput. Phys., 43, 357–372 (1981).MathSciNetzbMATHCrossRefGoogle Scholar
  6. [6]
    D. Roose and R.V. Driessche, “Parallel computers and parallel algorithms for CFD: an introduction’, AGARD-R.-807, 1995,pp. 1–23.Google Scholar
  7. [7]
    M.L. Sawley and J.K. Tegnér, “A comparison of parallel programming models for rnultiblock flow computations”, Journal of Computational Physics, 122, 280–290 (1995).zbMATHCrossRefGoogle Scholar
  8. [8]
    H. Wang, “A parallel solver for tridiagonal solvers”, ACM Transaction of Mathmatical Software, 7, 170–183 (1981).zbMATHCrossRefGoogle Scholar
  9. [9]
    Z. N. Wu, “Convergence study of an implicit multidomain method for compressible flow computations”, Computers and Fluids, 25, 181–196 (1996).MathSciNetzbMATHCrossRefGoogle Scholar
  10. [10]
    Z. N. Wu, “Uniqueness of steady state solutions for difference equations on overlapping grids”, SIAM Journal on Numerical Analysis, 33, 1336–1357 (1996).MathSciNetzbMATHCrossRefGoogle Scholar
  11. [11]
    Z. N. WI, “Steady and unsteady shock waves on overlapping grids”, SIAM Journal on Scientific Compututing, 20, 1851–1874 (1999).CrossRefGoogle Scholar
  12. [12]
    Z.N. Wu, H. Zou, “Grid overlapping for implicit parallel computations of compressible flows”, Journal of Computational Physics, 157, 2–43 (2000).zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Zi-Niu Wu
    • 1
  • Hui Zou
    • 1
  1. 1.Department of Engineering MechanicsTsinghua UniversityBeijingP.R.China

Personalised recommendations