|
THE MATHEMATICAL THEORY OF PERMANENT PROGRESSIVE WATER-WAVES
by Hisashi Okamoto (Kyoto University) & Mayumi Shõji (Japan Women's University)
Contents (125k)
Preface (145k)
Chapter 1: Introduction
Chapter 1.1: Formulation of the problem (558k)
Chapter 1.2: Waves on fluid of finite depth (196k)
Chapter 1.3: Primary bifurcation from the trivial flow (400k)
Chapter 1.4: Analyticity of the free boundary (220k)
Chapter 1.5: The case where bottom is not flat (127k)
Chapter 1.6: Three dimensional waves (131k)
Chapter 1.7: Remarks on equilibrium capillary surface (132k)
Chapter 1.8: Types of bifurcation (197k)
Chapter 1.9: Proof of Proposition (172k)
Chapter 1.10: List of Symbols (92k)
This book is a self-contained introduction to the theory of periodic, progressive, permanent waves on the surface of incompressible inviscid fluid. The problem of permanent water-waves has attracted a large number of physicists and mathematicians since Stokes' pioneering papers appeared in 1847 and 1880. Among many aspects of the problem, the authors focus on periodic progressive waves, which mean waves traveling at a constant speed with no change of shape. As a consequence, everything about standing waves are excluded and solitary waves are studied only partly. However, even for this restricted problem, quite a number of papers and books, in physics and mathematics, have appeared and more will continue to appear, showing the richness of the subject. In fact, there remain many open questions to be answered.
The present book consists of two parts: numerical experiments and normal form analysis of the bifurcation equations. Prerequisite for reading it is an elementary knowledge of the Euler equations for incompressible inviscid fluid and of bifurcation theory. Readers are also expected to know functional analysis at an elementary level. Numerical experiments are reported so that any reader can re-examine the results with minimal labor: the methods used in this book are well-known and are described as clearly as possible. Thus, the reader with an elementary knowledge of numerical computation will have little difficulty in the re-examination.
|
