- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Parallel direction splitting for 3D incompressible...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Parallel direction splitting for 3D incompressible Navier-Stokes equations Rajendran, Arun
Abstract
In this work, an efficient direction splitting algorithm for solving incompressible Navier-Stokes equations is implemented. The main feature of this method involves using the operator $A=(1-\parital_{xx})(1-\parital_{yy})(1-\parital_{zz})$ for approximately solving the pressure correction step instead of the Poisson operator used in the standard projection methods. The complexity of the algorithm is much lower as compared to the standard projection methods and it is shown to have similar convergence properties as Poisson based pressure-correction techniques. The algorithm is validated on multiple test cases, both in two and three dimensions, respectively. The method is suitable for parallel implementation and tests show excellent performance on a distributed memory cluster of up to 1,000 processors. Scalability results are reported on a three-dimensional lid-driven cavity flow for a range of processors on a large number of grid points.
Item Metadata
Title |
Parallel direction splitting for 3D incompressible Navier-Stokes equations
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2019
|
Description |
In this work, an efficient direction splitting algorithm for solving incompressible Navier-Stokes equations is implemented. The main feature of this method involves using the operator $A=(1-\parital_{xx})(1-\parital_{yy})(1-\parital_{zz})$ for approximately solving the pressure correction step instead of the Poisson operator used in the standard projection methods. The complexity of the algorithm is much lower as compared to the standard projection methods and it is shown to have similar convergence properties as Poisson based pressure-correction techniques. The algorithm is validated on multiple test cases, both in two and three dimensions, respectively. The method is suitable for parallel implementation and tests show excellent performance on a distributed memory cluster of up to 1,000 processors. Scalability results are reported on a three-dimensional lid-driven cavity flow for a range of processors on a large number of grid points.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2019-08-26
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0380620
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2019-09
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International