Geometric Theory Of Incompressible Flows With Applications To Fluid Dynamics

Geometric Theory of Incompressible Flows with Applications to Fluid Dynamics

This monograph presents a geometric theory for incompressible flow and its applications to fluid dynamics. The main objective is to study the stability and transitions of the structure of incompressible flows and its applications to fluid dynamics and geophysical fluid dynamics. The development of the theory and its applications goes well beyond its original motivation of the study of oceanic dynamics. The authors present a substantial advance in the use of geometric and topological methods to analyze and classify incompressible fluid flows. The approach introduces genuinely innovative ideas to the study of the partial differential equations of fluid dynamics. One particularly useful development is a rigorous theory for boundary layer separation of incompressible fluids. The study of incompressible flows has two major interconnected parts. The first is the development of a global geometric theory of divergence-free fields on general two-dimensional compact manifolds. The second is the study of the structure of velocity fields for two-dimensional incompressible fluid flows governed by the Navier-Stokes equations or the Euler equations. Motivated by the study of problems in geophysical fluid dynamics, the program of research in this book seeks to develop a new mathematical theory, maintaining close links to physics along the way. In return, the theory is applied to physical problems, with more problems yet to be explored. The material is suitable for researchers and advanced graduate students interested in nonlinear PDEs and fluid dynamics.

The Ricci Flow: Techniques and Applications

Geometric Approximation Algorithms

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.