Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations
This thesis deals with the numerical solution of convection-diffusion equations. In particular, the focus is on the analysis of applying one step of cyclic reduction to linear systems of equations which arise from finite difference discretization of steady-state three-dimensional convection-diffus...
Main Author: | |
---|---|
Format: | Others |
Language: | English |
Published: |
2009
|
Online Access: | http://hdl.handle.net/2429/8505 |
id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-8505 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-85052018-01-05T17:34:13Z Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations Greif, Chen This thesis deals with the numerical solution of convection-diffusion equations. In particular, the focus is on the analysis of applying one step of cyclic reduction to linear systems of equations which arise from finite difference discretization of steady-state three-dimensional convection-diffusion equations. The method is based on decoupling the unknowns and solving the resulting smaller linear systems using iterative methods. In three dimensions this procedure results in some loss of sparsity, compared to lower dimensions. Nevertheless, the resulting linear system has excellent numerical properties, is generally better conditioned than the original system, and gives rise to faster convergence of iterative solvers, and convergence in cases where solvers of the original system of equations fail to converge. The thesis starts with an overview of the equations that are solved and general properties of the resulting linear systems. Then, the unsymmetric discrete operator is derived and the structure of the cyclically reduced linear system is described. Several important aspects are analyzed in detail. The issue of orderings is addressed and a highly effective ordering strategy is presented. The complicated sparsity pattern of the matrix requires careful analysis; comprehensive convergence analysis for block stationary methods is provided, and the bounds on convergence rates are shown to be very tight. The computational work required to perform cyclic reduction and compute the solution of the linear system is discussed at length. Preconditioning techniques and various iterative solvers are considered. Science, Faculty of Mathematics, Department of Graduate 2009-05-29T22:43:13Z 2009-05-29T22:43:13Z 1998 1998-05 Text Thesis/Dissertation http://hdl.handle.net/2429/8505 eng For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. 7773753 bytes application/pdf |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
description |
This thesis deals with the numerical solution of convection-diffusion equations. In particular, the
focus is on the analysis of applying one step of cyclic reduction to linear systems of equations
which arise from finite difference discretization of steady-state three-dimensional convection-diffusion
equations. The method is based on decoupling the unknowns and solving the resulting
smaller linear systems using iterative methods. In three dimensions this procedure results in
some loss of sparsity, compared to lower dimensions. Nevertheless, the resulting linear system
has excellent numerical properties, is generally better conditioned than the original system, and
gives rise to faster convergence of iterative solvers, and convergence in cases where solvers of
the original system of equations fail to converge.
The thesis starts with an overview of the equations that are solved and general properties of
the resulting linear systems. Then, the unsymmetric discrete operator is derived and the structure
of the cyclically reduced linear system is described. Several important aspects are analyzed
in detail. The issue of orderings is addressed and a highly effective ordering strategy is presented.
The complicated sparsity pattern of the matrix requires careful analysis; comprehensive
convergence analysis for block stationary methods is provided, and the bounds on convergence
rates are shown to be very tight. The computational work required to perform cyclic reduction
and compute the solution of the linear system is discussed at length. Preconditioning techniques
and various iterative solvers are considered. === Science, Faculty of === Mathematics, Department of === Graduate |
author |
Greif, Chen |
spellingShingle |
Greif, Chen Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations |
author_facet |
Greif, Chen |
author_sort |
Greif, Chen |
title |
Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations |
title_short |
Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations |
title_full |
Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations |
title_fullStr |
Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations |
title_full_unstemmed |
Analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations |
title_sort |
analysis of cyclic reduction for the numerical solution of three-dimensional convection-diffusion equations |
publishDate |
2009 |
url |
http://hdl.handle.net/2429/8505 |
work_keys_str_mv |
AT greifchen analysisofcyclicreductionforthenumericalsolutionofthreedimensionalconvectiondiffusionequations |
_version_ |
1718587979632476160 |