Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.643610
Title: Multigrid methods for nonlinear second order partial differential operators
Author: Brabazon, Keeran J.
ISNI:       0000 0004 5354 7675
Awarding Body: University of Leeds
Current Institution: University of Leeds
Date of Award: 2014
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
This thesis is concerned with the efficient numerical solution of nonlinear partial differential equations (PDEs) of elliptic and parabolic type. Such PDEs arise frequently in models used to describe many physical phenomena, from the diffusion of a toxin in soil to the flow of viscous fluids. The main focus of this research is to better understand the implementation and performance of nonlinear multigrid methods for the solution of elliptic and parabolic PDEs, following their discretisation. For the most part finite element discretisations are considered, but other techniques are also discussed. Following discretisation of a PDE the two most frequently used nonlinear multigrid methods are Newton-Multigrid and the Full Approximation Scheme (FAS). These are both very efficient algorithms, and have the advantage that when they are applied to practical problems, their execution times scale linearly with the size of the problem being solved. Even though this has yet to be proved in theory for most problems, these methods have been widely adopted in practice in order to solve highly complex nonlinear (systems of) PDEs. Many research groups use either Newton-MG or FAS without much consideration as to which should be preferred, since both algorithms perform satisfactorily. In this thesis we address the question as to which method is likely to be more computationally efficient in practice. As part of this investigation the implementation of the algorithms is considered in a framework which allows the direct comparison of the computational effort of the two iterations. As well as this, the convergence properties of the methods are considered, applied to a variety of model problems. Extensive results are presented in the comparison, which are explained by available theory whenever possible. The strength and range of results presented allows us to confidently conclude that for a practical problem, discretised using a finite element discretisation, an improved efficiency and stability of a Newton-MG iteration, compared to an FAS iteration, is likely to be observed. The relative advantage of a Newton-MG method is likely to be larger the more complex the problem being solved becomes.
Supervisor: Jimack, Peter K. ; Hubbard, Matthew E. Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.643610  DOI: Not available
Share: