Find a copy in the library
Finding libraries that hold this item...
Details
Document Type: | Book, Computer File |
---|---|
All Authors / Contributors: |
J Blazek |
ISBN: | 0080445063 9780080445069 0080448577 9780080448572 0080448677 9780080448671 0080448674 |
OCLC Number: | 61129105 |
Notes: | Previous edition: Amsterdam: Elsevier Science, 2001. |
Description: | xx, 470 pages : illustrations ; 25 cm + 1 CD-ROM (4 3/4 in.) |
Details: | System requirements for accompanying CD-ROM: Windows, or UNIX/Linux/Mac OS X. |
Contents: | 1. Introduction -- 2. Governing Equations -- 3. Principles of Solution of the Governing Equations -- 4. Spatial Discretisation: Structured Finite Volume Schemes -- 5. Spatial Discretisation: Unstructured Finite Volume Schemes -- 6. Temporal Discretisation -- 7. Turbulence Modelling -- 8. Boundary Conditions -- 9. Acceleration Techniques -- 10. Consistency, Accuracy and Stability -- 11. Principles of Grid Generation -- 12. Description of the Source Codes. 1. Introduction -- 2. Governing equations -- 3. Principles of solution of the governing equations -- 4. Structured finite volume schemes -- 5. Unstructured finite volume schemes -- 6. Temporal discretisation -- 7. Turbulence modelling -- 8. Boundary conditions -- 9. Acceleration techniques -- 10. Consistency, accuracy and stability -- 11. Principles of grid generation -- 12. Description of the source codes. |
Responsibility: | J. Blazek. |
Abstract:
Computational Fluid Dynamics (CFD) is an important design tool in engineering and also a substantial research tool in various physical sciences as well as in biology. This book provides university students with a foundation for understanding the numerical methods employed in CFD and to familiarises them with modern CFD codes.
Read more...
Reviews
User-contributed reviews
Add a review and share your thoughts with other readers.
Be the first.
Add a review and share your thoughts with other readers.
Be the first.


Tags
Add tags for "Computational fluid dynamics : principles and applications".
Be the first.