University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Adaptive Stochastic Galerkin Finite Element Approximation for Elliptic PDEs with Random Coefficients

Adaptive Stochastic Galerkin Finite Element Approximation for Elliptic PDEs with Random Coefficients

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

UNQW02 - Surrogate models for UQ in complex systems

Co-author: Adam Crowder (University of Manchester)

We consider a standard elliptic PDE model with uncertain coefficients. Such models are simple, but are well understood theoretically and so serve as a canonical class of problems on which to compare different numerical schemes (computer models).

Approximations which take the form of polynomial chaos (PC) expansions have been widely used in applied mathematics and can be used as surrogate models in UQ studies. When the coefficients of the approximation are computed using a Galerkin method, we use the term ‘Stochastic Galerkin approximation’. In statistics, the term ‘intrusive PC approximation’ is also often used. In the Galerkin approach, the resulting PC approximation is optimal in that the energy norm of the error between the true model solution and the PC approximation is minimised. This talk will focus on how to build the approximation space (in a computer code) in a computationally efficient way while also guaranteeing accuracy.

In the stochastic Galerkin finite element (SGFEM) approach, an approximation is sought in a space which is defined through a chosen set of spatial finite element basis functions and a set of orthogonal polynomials in the parameters that define the uncertain PDE coefficients. When the number of parameters is too high, the dimension of this space becomes unmanageable. One remedy is to use ‘adaptivity’. First, we generate an approximation in a low-dimensional approximation space (which is cheap) and then use a computable a posteriori error estimator to decide whether the current approximation is accurate enough or not. If not, we enrich the approximation space, estimate the error again, and so on, until the final approximation is accurate enough. This allows us to design problem-specific polynomial approximations. We describe an error estimation procedure, outline the computational costs, and illustrate its use through numerical results. An improved multilevel implem entation will be outlined in a poster given by Adam Crowder.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity