Numerical Solutions of the Euler Equations for Steady Flow Problems (Paperback, Softcover reprint of the original 1st ed. 1992)

The last decade has seen a dramatic increase of our abilities to solve numerically the governing equations of fluid mechanics. In design aerodynamics the classical potential-flow methods have been complemented by higher modelling-level methods. Euler solvers, and for special purposes, already Navier-Stokes solvers are in use. The authors of this book have been working on the solution of the Euler equations for quite some time. While the first two of us have worked mainly on algorithmic problems, the third has been concerned off and on with modelling and application problems of Euler methods. When we started to write this book we decided to put our own work at the center of it. This was done because we thought, and we leave this to the reader to decide, that our work has attained over the years enough substance in order to justify a book. The problem which we soon faced, was that the field still is moving at a fast pace, for instance because hyper sonic computation problems became more and more important."

General

Imprint:	Vieweg+teubner Verlag
Country of origin:	Germany
Series:	Notes on Numerical Fluid Mechanics, 48
Release date:	1992
First published:	1992
Authors:	Albrecht Eberle • Arthur Rizzi • Ernst Heinrich Hirschel
Dimensions:	235 x 155 x 24mm (L x W x T)
Format:	Paperback
Pages:	448
Edition:	Softcover reprint of the original 1st ed. 1992
ISBN-13:	978-3-528-07634-4
Categories:	Books > Computing & IT > General theory of computing > General Books > Computing & IT > Applications of computing > General Books > Science & Mathematics > Physics > Classical mechanics > Fluid mechanics
LSN:	3-528-07634-8
Barcode:	9783528076344

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!