Proper generalised decompositions: theory and applications

Croft, Thomas Lloyd David 2015. Proper generalised decompositions: theory and applications. PhD Thesis, Cardiff University. Item availability restricted.

Preview	PDF - Accepted Post-Print Version Download (2MB) | Preview
	PDF - Supplemental Material Restricted to Repository staff only Download (745kB)

Abstract

In this thesis a recently proposed method for the efficient approximation of solutions to high-dimensional partial differential equations has been investigated. This method, known as the Proper Generalised Decomposition (PGD), seeks a separated representation of the unknown field which leads to the solution of a series of low-dimensional problems instead of a single high-dimensional problem. This effectively bypasses the computational issue known as the `curse of dimensionality'. The PGD and its recent developments are reviewed and we present results for both the Poisson and Stokes problems. Furthermore, we investigate convergence of PGD algorithms by comparing them to greedy algorithms which have previously been studied in the non-linear approximation community. We highlight that convergence of PGD algorithms is not guaranteed when a Galerkin formulation of the problem is considered. Furthermore, it is shown that stability conditions related to weakly coercive problems (such as the Stokes problem) are not guaranteed to hold when employing a PGD approximation

Item Type:	Thesis (PhD)
Date Type:	Completion
Status:	Unpublished
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Date of First Compliant Deposit:	30 March 2016
Last Modified:	10 Jun 2022 14:52
URI:	https://orca.cardiff.ac.uk/id/eprint/73515

Actions (repository staff only)

Edit Item