A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel
This thesis aims to present a unified framework for deriving analytical formulas for multigrid smoothing factors in arbitrary dimensions, under certain simplifying assumptions. To derive these expressions we rely on complex analysis and geometric considerations, using the maximum modulus principle a...
Main Author: | |
---|---|
Language: | English |
Published: |
University of British Columbia
2011
|
Online Access: | http://hdl.handle.net/2429/37012 |
id |
ndltd-UBC-oai-circle.library.ubc.ca-2429-37012 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UBC-oai-circle.library.ubc.ca-2429-370122018-01-05T17:25:18Z A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel Hocking, Laird Robert This thesis aims to present a unified framework for deriving analytical formulas for multigrid smoothing factors in arbitrary dimensions, under certain simplifying assumptions. To derive these expressions we rely on complex analysis and geometric considerations, using the maximum modulus principle and Mobius transformations. We restrict our attention to pointwise and block lexicographic Gauss-Seidel smoothers on a d-dimensional uniform mesh, where the computational molecule of the associated discrete operator forms a 2d+1 point star. In the pointwise case the effect of a relaxation parameter, as well as different choices of mesh ratio, are analyzed. The results apply to any number of spatial dimensions, and are applicable to high-dimensional versions of a few common model problems with constant coefficients, including the Poisson and anisotropic diffusion equations as well as the convection-diffusion equation. We show that in most cases our formulas, exact under the simplifying assumptions of Local Fourier Analysis, form tight upper bounds for the asymptotic convergence of geometric multigrid in practice. We also show that there are asymmetric cases where lexicographic Gauss-Seidel smoothing outperforms red-black Gauss-Seidel smoothing; this occurs for certain model convection-diffusion equations with high mesh Reynolds numbers. Science, Faculty of Computer Science, Department of Graduate 2011-08-30T20:41:31Z 2011-08-30T20:41:31Z 2011 2011-11 Text Thesis/Dissertation http://hdl.handle.net/2429/37012 eng Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/ University of British Columbia |
collection |
NDLTD |
language |
English |
sources |
NDLTD |
description |
This thesis aims to present a unified framework for deriving analytical formulas for multigrid smoothing factors in arbitrary dimensions, under certain simplifying assumptions. To derive these expressions we rely on complex analysis and geometric considerations, using the maximum modulus principle and Mobius transformations.
We restrict our attention to pointwise and block lexicographic Gauss-Seidel smoothers on a d-dimensional uniform mesh, where the computational molecule of the associated discrete operator forms a 2d+1 point star. In the pointwise case the effect of a relaxation parameter, as well as different choices of mesh ratio, are analyzed. The results apply to any number of spatial dimensions, and are applicable to high-dimensional versions of a few common model problems with constant coefficients, including the Poisson and anisotropic diffusion equations as well as the convection-diffusion equation. We show that in most cases our formulas, exact under the simplifying assumptions of Local Fourier Analysis, form tight upper bounds for the asymptotic convergence of geometric multigrid in practice. We also show that there are asymmetric cases where lexicographic Gauss-Seidel smoothing outperforms red-black Gauss-Seidel smoothing; this occurs for certain model convection-diffusion equations with high mesh Reynolds numbers. === Science, Faculty of === Computer Science, Department of === Graduate |
author |
Hocking, Laird Robert |
spellingShingle |
Hocking, Laird Robert A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel |
author_facet |
Hocking, Laird Robert |
author_sort |
Hocking, Laird Robert |
title |
A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel |
title_short |
A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel |
title_full |
A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel |
title_fullStr |
A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel |
title_full_unstemmed |
A complex analysis based derivation of multigrid smoothing factors of lexicographic Gauss-Seidel |
title_sort |
complex analysis based derivation of multigrid smoothing factors of lexicographic gauss-seidel |
publisher |
University of British Columbia |
publishDate |
2011 |
url |
http://hdl.handle.net/2429/37012 |
work_keys_str_mv |
AT hockinglairdrobert acomplexanalysisbasedderivationofmultigridsmoothingfactorsoflexicographicgaussseidel AT hockinglairdrobert complexanalysisbasedderivationofmultigridsmoothingfactorsoflexicographicgaussseidel |
_version_ |
1718583017605169152 |