Bounds on the enstrophy growth rate for solutions of the three-dimensional Navier-Stokes equations.
dc.contributor.author | Lu, Lu | |
dc.contributor.advisor | Doering, Charles R. | |
dc.contributor.advisor | Lithgow-Bertelloni, Carolina R. | |
dc.date.accessioned | 2016-08-30T16:03:08Z | |
dc.date.available | 2016-08-30T16:03:08Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:3224686 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/125819 | |
dc.description.abstract | It is still an open problem whether smooth solutions to the 3D Navier-Stokes equations lose regularity in finite time. But it is known that if the enstrophy ( w</fen></fen> 22 ) remains finite, the solution is regular. The growth rate of the enstrophy can be estimated from the Navier-Stokes equations by Sobolev inequalities. In general form, dw</fen></fen> 22/dt≤c w</fen></fen>2 2</fen>a , where <italic>c</italic> is a constant. In 2D the exponent alpha is 2 and leads to regularity. However, alpha = 3 in 3D, which yields only finite-time regularity of the solutions. In these estimates, incompressibility is not used. We formulate the maximal enstrophy growth rate as a variational problem and include incompressibility as a constraint. The variational problem is solved numerically by a gradient-flow type algorithm. Our results show that alpha = 1.78 for small enstrophies and alpha = 3 as enstrophy gets larger. Thus the Sobolev bounds are actually realizable even with incompressibility constraint. | |
dc.format.extent | 96 p. | |
dc.language | English | |
dc.language.iso | EN | |
dc.subject | Dimensional | |
dc.subject | Enstrophy | |
dc.subject | Growth | |
dc.subject | Navier-stokes Equations | |
dc.subject | Rate | |
dc.subject | Sobolev Bounds | |
dc.subject | Solutions | |
dc.subject | Three | |
dc.title | Bounds on the enstrophy growth rate for solutions of the three-dimensional Navier-Stokes equations. | |
dc.type | Thesis | |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Mathematics | |
dc.description.thesisdegreediscipline | Pure Sciences | |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/125819/2/3224686.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.