All listings for this product
Save on Textbooks
- AU $13.75Trending at AU $17.77
- AU $69.53Trending at AU $85.78
- AU $56.99Trending at AU $71.10
- AU $35.12Trending at AU $54.44
- AU $17.60Trending at AU $22.00
- AU $29.91Trending at AU $39.03
- AU $35.62Trending at AU $37.37
About this product
- DescriptionHigh-order numerical methods provide an efficient approach to simulating many physical problems. This book considers the range of mathematical, engineering, and computer science topics that form the foundation of high-order numerical methods for the simulation of incompressible fluid flows in complex domains. Introductory chapters present high-order spatial and temporal discretizations for one-dimensional problems. These are extended to multiple space dimensions with a detailed discussion of tensor-product forms, multi-domain methods, and preconditioners for iterative solution techniques. Numerous discretizations of the steady and unsteady Stokes and Navier-Stokes equations are presented, with particular attention given to enforcement of incompressibility. Advanced discretizations, implementation issues, and parallel and vector performance are considered in the closing sections. Numerous examples are provided throughout to illustrate the capabilities of high-order methods in actual applications. Computer scientists, engineers and applied mathematicians interested in developing software for solving flow problems will find this book a valuable reference.
- Author(s)E. H. Mund,M. O. Deville,P. F. Fischer
- PublisherCambridge University Press
- Date of Publication15/08/2002
- Series TitleCambridge Monographs on Applied and Computational Mathematics
- Series Part/Volume NumberNo. 9
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content Note104 b/w illus.
- Weight870 g
- Width152 mm
- Height228 mm
- Spine29 mm
- Series Edited byMark J. Ablowitz,S. H. Davis,E. J. Hinch,A. Iserles,J. Ockendon,P. J. Olver
This item doesn't belong on this page.
Thanks, we'll look into this.