MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An iterative pressure-correction method for the unsteady incompressible Navier-Stokes Equation

Author(s)
Aoussou, Jean Philippe
Thumbnail
DownloadFull printable version (5.040Mb)
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Pierre F.J. Lermusiaux.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
The pressure-correction projection method for the incompressible Navier-Stokes equation is approached as a preconditioned Richardson iterative method for the pressure- Schur complement equation. Typical pressure correction methods perform only one iteration and suffer from a splitting error that results in a spurious numerical boundary layer, and a limited order of convergence in time. We investigate the benefit of performing more than one iteration. We show that that not only performing more iterations attenuates the effects of the splitting error, but also that it can be more computationally efficient than reducing the time step, for the same level of accuracy. We also devise a stopping criterion that helps achieve a desired order of temporal convergence, and implement our method with multi-stage and multi-step time integration schemes. In order to further reduce the computational cost of our iterative method, we combine it with an Aitken acceleration scheme. Our theoretical results are validated and illustrated by numerical test cases for the Stokes and Navier-Stokes equations, using Implicit-Explicit Backwards Difference Formula and Runge-Kutta time integration solvers. The test cases comprises a now classical manufactured solution in the projection method literature and a modified version of a more recently proposed manufactured solution.
Description
Thesis: S.M., Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2016.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (pages 53-59).
 
Date issued
2016
URI
http://hdl.handle.net/1721.1/104554
Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
Publisher
Massachusetts Institute of Technology
Keywords
Computation for Design and Optimization Program.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.