Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678013
Title: Sparse space-time boundary element methods for the heat equation
Author: Reinarz, Anne
ISNI:       0000 0004 5369 8465
Awarding Body: University of Reading
Current Institution: University of Reading
Date of Award: 2015
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
The goal of this work is the efficient solution of the heat equation with Dirichlet or Neumann boundary conditions using the Boundary Elements Method (BEM). Efficiently solving the heat equation is useful, as it is a simple model problem for other types of parabolic problems. In complicated spatial domains as often found in engineering, BEM can be beneficial since only the boundary of the domain has to be discretised. This makes BEM easier than domain methods such as finite elements and finite differences, conventionally combined with time-stepping schemes to solve this problem. The contribution of this work is to further decrease the complexity of solving the heat equation, leading both to speed gains (in CPU time) as well as requiring smaller amounts of memory to solve the same problem. To do this we will combine the complexity gains of boundary reduction by integral equation formulations with a discretisation using wavelet bases. This reduces the total work to O(hₓ-(d-1)), when the solution of the linear system is performed with linear complexity. We show that the discretisation with a wavelet basis leads to a numerically sparse matrix. Further, we show that this matrix can be compressed without losing accuracy of the underlying Galerkin scheme. This matrix compression reduces the number of non-zero matrix entries from O(N2) to O(N). Thus, we can indeed solve the linear system in linear time. It has been shown theoretically that using sparse grid methods leads to considerably higher convergence rates in the energy norm of the problem. In this work we will show that the convergence can be further improved for some choices of polynomial degrees by using more general sparse grid spaces. We also give numerical results to verify the theoretical bounds from [Chernov, Schwab, 2013].
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.678013  DOI: Not available
Share: