Flux-Corrected Transport: Principles, Algorithms, and Applications [Hardcover]

Addressing students and researchers as well as Computational Fluid Dynamics practitioners, this book is the most comprehensive review of high-resolution schemes based on the principle of Flux-Corrected Transport (FCT). The foreword by J.P. Boris and historical note by D.L. Book describe the development of the classical FCT methodology for convection-dominated transport problems, while the design philosophy behind modern FCT schemes is explained by S.T. Zalesak. The subsequent chapters present various improvements and generalizations proposed over the past three decades.
In this new edition, recent results are integrated into existing chapters in order to describe significant advances since the publication of the first edition. Also, 3 new chapters were added in order to cover the following topics: algebraic flux correction for finite elements, iterative and linearized FCT schemes, TVD-like flux limiters, acceleration of explicit and implicit solvers, mesh adaptation, failsafe limiting for systems of conservation laws, flux-corrected interpolation (remapping), positivity preservation in RANS turbulence models, and the use of FCT as an implicit subgrid scale model for large eddy simulations.

In this step-by-step guide to numerical simulations of complex transport phenomena, now in an updated second edition, the authors provide an in-depth presentation of modern FCT algorithms as well as the range of criteria underlying their design.

The conception, gestation, birth and infancy of FCT.- The design of flux-corrected transport (FCT) algorithms for structured grids.- On monotonically integrated large eddy simulation of tubulent flows based on FCT algorithms.- Large scale urban simulations with FCT.- 30 years of FCT.- Algebraic flux corretion I.- Algebraic flux correction II.- Algebraic flux correction III.- Algebraic flux correction IV.- An evaluation of the FCT method for high-speed flows.- Flux-corrected and optimization-based remap.

Ml£.