A Computational Fluid Dynamics Algorithm On a Massively Parallel Computer
- 1 December 1989
- journal article
- other
- Published by SAGE Publications in The International Journal of Supercomputing Applications
- Vol. 3 (4) , 9-27
- https://doi.org/10.1177/109434208900300403
Abstract
The discipline of computational fluid dynamics is de manding ever-increasing computational power to deal with complex fluid flow problems. We investigate the performance of a finite-difference computational fluid dynamics algorithm on a massively parallel computer, the Connection Machine. Of special interest is an implicit time-stepping algorithm; to obtain maximum perfor mance from the Connection Machine, it is necessary to use a nonstandard algorithm to solve the linear systems that arise in the implicit algorithm. We find that the Connection Machine can achieve very high computation rates on both explicit and implicit algorithms. The per formance of the Connection Machine puts it in the same class as today's most powerful conventional supercomputers.Keywords
This publication has 6 references indexed in Scilit:
- Spectral solution of the incompressible Navier-Stokes equations on the Connection Machine 2Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Implementation of an ADI Method on parallel computersJournal of Scientific Computing, 1987
- Implicit solution methods in computational fluid dynamicsApplied Numerical Mathematics, 1986
- A diagonal form of an implicit approximate-factorization algorithmJournal of Computational Physics, 1981
- A Survey of Parallel Algorithms in Numerical Linear AlgebraSIAM Review, 1978
- An implicit finite-difference algorithm for hyperbolic systems in conservation-law formJournal of Computational Physics, 1976