Multilevel Intrusive UQ Methods

Lead Research Organisation: University of Manchester
Department Name: Mathematics

Abstract

Physical processes such as heat transfer and fluid flows are typically modelled using partial differential equations (PDEs). If all the inputs (coefficients, boundary conditions etc) are known then standard numerical schemes such as finite element methods can be used to perform simulations and predict quantities of interest related to the model solution. In engineering problems, however, we frequently encounter scenarios where we are uncertain about one or more model inputs. The most common way to deal with this is to appeal to probability theory and represent uncertain inputs as functions of random variables. Estimating quantities of interest related to solutions of models with random inputs with a prescribed probability distribution is called forward uncertainty quantification (UQ). Although many algorithms for performing forward UQ exist, estimating statistical quantities of interest efficiently and accurately for complex PDE models remains an important scientific challenge.

This project will make theoretical and computational advances in the development of so-called multilevel intrusive (MINT) algorithms for forward UQ that are computationally efficient and also provably accurate. Unlike sampling methods, intrusive schemes seek approximations which are polynomials of the random inputs. Standard intrusive methods are unpopular because they require the solution of huge linear systems of equations which quickly exhausts available computational resources. The main issue is that they use large tensor product approximation spaces which leads to wasted computations. Advances will be made by constructing lower-dimensional approximation spaces with flexible multilevel structure driven by an automated and accurate assessment of error.
 
Description Theoretical results in the literature previously established that is was possible to approximate solutions to partial differential equations with uncertain inputs in such a way that the rate of convergence is independent of the number of input parameters. Our work has established that for certain test problems it is possible to develop adaptive computational algorithms that actually achieve these sought after optimal convergence rates. Open source software has been released that illustrates this on a special set of test problems.
Exploitation Route The second part of the project involves investigating whether the above key finding extends to more complex problems that are closer to real-world applications. The open source software that has been developed will allow others to take the same methodology and apply it to their own problems.
Sectors Other

 
Title ML-SGFEM 
Description A MATLAB toolbox for investigating adaptive multilevel stochastic Galerkin finite element approximation of parametric elliptic PDEs. 
Type Of Technology Software 
Year Produced 2022 
Open Source License? Yes  
Impact The software can be used to investigate computational issues associated with multilevel stochastic Galerkin finite element approximation for elliptic PDEs with parameter-dependent coefficients. The distinctive feature of the software is the hierarchical a posteriori error estimation strategy it uses to drive the adaptive enrichment of the approximation space at each step. Users may select different strategies for constructing the approximation space and investigate the impact of these choices on the results obtained. 
URL http://eprints.maths.manchester.ac.uk/2859/