Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/23087
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorProtas, Bartosz-
dc.contributor.authorSliwiak, Adam-
dc.date.accessioned2018-06-13T19:39:25Z-
dc.date.available2018-06-13T19:39:25Z-
dc.date.issued2017-
dc.identifier.urihttp://hdl.handle.net/11375/23087-
dc.description.abstractOne 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.en_US
dc.language.isoenen_US
dc.subjectChebyshev Methoden_US
dc.subjectEnstrophyen_US
dc.subjectNavier-Stokesen_US
dc.subjectNumerical Optimizationen_US
dc.subjectVorticity-Streamfunction Formulationen_US
dc.titleMaximum Rate of Growth of Enstrophy in the Navier-Stokes System on 2D Bounded Domainsen_US
dc.typeThesisen_US
dc.contributor.departmentComputational Engineering and Scienceen_US
dc.description.degreetypeThesisen_US
dc.description.degreeMaster of Science (MSc)en_US
dc.description.layabstractFor many decades, scientists have been investigating fundamental aspects of the Navier-Stokes equation, a central mathematical model arising in fluid mechanics. Although the equation is widely used by engineers to describe numerous flow phenomena, it is still an open question whether the Navier-Stokes system always admits physically meaningful solutions. To address this issue, we want to explore its mathematical aspects deeper by analyzing the behaviour of the enstrophy, which is a quantity associated with the vorticity of the flow and a convenient measure of the regularity of the solution. In this study, we consider a planar and incompressible flow bounded by solid walls. Using basic tools of mathematical analysis and optimization theory, we propose a computational method enabling us to find out how much enstrophy can such a flow produce instantaneously. We present numerical evidence that this instantaneous growth of enstrophy has a well-defined asymptotic behavior, which is consistent with physical assumptions.en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File Description SizeFormat 
sliwiak_adam_a_2017august_masters.pdf
Open Access
Master's Thesis8.2 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue