Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/23087
Title: | Maximum Rate of Growth of Enstrophy in the Navier-Stokes System on 2D Bounded Domains |
Authors: | Sliwiak, Adam |
Advisor: | Protas, Bartosz |
Department: | Computational Engineering and Science |
Keywords: | Chebyshev Method;Enstrophy;Navier-Stokes;Numerical Optimization;Vorticity-Streamfunction Formulation |
Publication Date: | 2017 |
Abstract: | One of the key open problems in the field of theoretical fluid mechanics concerns the possibility of the singularity formation in solutions of the 3D Navier-Stokes system in finite time. This phenomenon is associated with the behaviour of the enstrophy, which is an L2 norm of the vorticity and must become unbounded if such a singularity occurs. Although there is no blow-up in the 2D Navier-Stokes equation, we would like to investigate how much enstrophy can a planar incompressible flow in a bounded domain produce given certain initial enstrophy. We address this issue by formulating an optimization problem in which the time derivative of the enstrophy serves as the objective functional and solve it using tools of the optimization theory and calculus of variations. We propose an efficient computational approach which is based on the iterative steepest-ascent procedure. In addition, we introduce an easy-to-implement method of computing the gradient of the objective functional. Finally, we present computational results addressing the key question of this project and provide numerical evidence that the maximum enstrophy growth exhibits the scaling dE/dt ~ C*E*E for C>0 and very small E. All computations are performed using the Chebyshev spectral method. |
URI: | http://hdl.handle.net/11375/23087 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
sliwiak_adam_a_2017august_masters.pdf | Master's Thesis | 8.2 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.