University of British Columbia
An experimental study of the incomplete Cholesky factorization for the anisotropic diffusion equation
Abstract
dc:descriptionWe consider the numerical solution of large and sparse linear systems arising from a finite difference discretization of the anisotropic diffusion equation. We study preconditioned conjugate gradient as an iterative solver, with the incomplete Cholesky factorization as a preconditioner. The incomplete Cholesky factor is created using two different dynamic dropping parameters: a drop tolerance to control the magnitude of included values, and a fill factor to control the memory allocation/usage of the factor. For large matrices, we show that certain drop tolerances will achieve optimal results with a controllable amount of memory usage. Our numerical experiments are based on a fast C code that has been written as part of this research project, and which uses an asymptotically optimal version of the Cholesky factorization as its base. We illustrate our findings on linear systems of dimensions up to ten million degrees of freedom.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Beauchamp, Austin
- Contributors dc:contributor
-
- Greif, Chen, 1965-
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/82657