- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- GPU computing of yield stress fluid flows in narrow...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
GPU computing of yield stress fluid flows in narrow gaps Medina Lino, Ivonne Leonor
Abstract
We present a GPU implementation of non-Newtonian Hele-Shaw flow that models the displacement of Herschel-Bulkley fluids along narrow eccentric annuli. This flow is characteristic of many long-thin flows that require extensive calculation due to an inherent nonlinearity in the constitutive law. A common method of dealing with such flows is via an augmented Lagrangian algorithm, which is often painfully slow. Here we show that such algorithms, although involving slow iterations, can often be accelerated via parallel implementation on graphic processor units (GPUs). Indeed, such algorithms explicitly solve the nonlinear aspects only locally on each mesh cell (or node), which makes them ideal candidates for GPU. Combined with other advances, the optimized GPU implementation takes ≈ 2.5% of the time of the original algorithm.
Item Metadata
Title |
GPU computing of yield stress fluid flows in narrow gaps
|
Creator | |
Supervisor | |
Publisher |
University of British Columbia
|
Date Issued |
2023
|
Description |
We present a GPU implementation of non-Newtonian Hele-Shaw flow that models
the displacement of Herschel-Bulkley fluids along narrow eccentric annuli. This
flow is characteristic of many long-thin flows that require extensive calculation
due to an inherent nonlinearity in the constitutive law. A common method of dealing
with such flows is via an augmented Lagrangian algorithm, which is often
painfully slow. Here we show that such algorithms, although involving slow iterations,
can often be accelerated via parallel implementation on graphic processor
units (GPUs). Indeed, such algorithms explicitly solve the nonlinear aspects only
locally on each mesh cell (or node), which makes them ideal candidates for GPU.
Combined with other advances, the optimized GPU implementation takes ≈ 2.5%
of the time of the original algorithm.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2023-07-17
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0434224
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2023-11
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International