×

Driven cavity flows by efficient numerical techniques. (English) Zbl 0503.76040


MSC:

76D05 Navier-Stokes equations for incompressible viscous fluids
76M99 Basic methods in fluid mechanics
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Benjamin, A. S.; Denny, V. E., On the convergence of numerical solutions for 2-D flows in a cavity at high Re, J. Comput. Phys., 12, 348 (1973)
[2] Ghia, U.; Ghia, K. N.; Shin, C. T., Solution of Incompressible Navier-Stokes Equations by Coupled Strongly-Implicit Multigrid Method, (presented at the Symposium on Multigrid Methods (1981), NASA Ames Research Center: NASA Ames Research Center Moffett Field, Calif) · Zbl 0511.76031
[3] Keller, H. B., (Rabinowitz, P. H., Applications of Bifurcation Theory (1977), Academic Press: Academic Press New York)
[4] Roache, J., Computational Fluid Dynamics (1972), Hermosa: Hermosa Albequerque, N. Mex · Zbl 0251.76002
[5] Schreiber, R., Finite-Difference Methods for Singular Perturbation and Navier-Stokes Problems, (Stanford Numerical Analysis Project Report NA-80-09 (1980), Computer Science Department, Stanford Univ: Computer Science Department, Stanford Univ Stanford, Calif)
[6] Schreiber, R. S.; Keller, H. B., Spurious solutions in driven cavity calculations, J. Comput. Phys., 49, 165 (1983) · Zbl 0502.76044
[7] Tuann, S.-Y.; Olson, M. D., Review of computing methods for recirculating flows, J. Comput. Phys., 29, 1 (1978) · Zbl 0427.76028
[8] Winters, K. H.; Cliffs, K. A., A Finite Element Study of Laminar Flows in a Square Cavity, UKAERE Harwell Report R9444 (1979)
[9] Wood, W. W., Boundary layers whose streamlines are closed, J. Fluid Mech., 2, 77 (1957) · Zbl 0077.19401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.