Low-rank cross approximation algorithms for the solution of stochastic PDEs

49 mins 6 secs, 714.48 MB, MPEG-4 Video 640x360, 29.97 fps, 44100 Hz, 1.94 Mbits/sec

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/2687276/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	Dolgov, S Wednesday 7th March 2018 - 11:00 to 11:45


Created:	2018-03-07 16:40
Collection:	Uncertainty quantification for complex systems: theory and methodologies
Publisher:	Isaac Newton Institute
Copyright:	Dolgov, S
Language:	eng (English)


Abstract:	Co-authors: Robert Scheichl (University of Bath) We consider the approximate solution of parametric PDEs using the low-rank Tensor Train (TT) decomposition. Such parametric PDEs arise for example in uncertainty quantification problems in engineering applications. We propose an algorithm that is a hybrid of the alternating least squares and the TT cross methods. It computes a TT approximation of the whole solution, which is particularly beneficial when multiple quantities of interest are sought. The new algorithm exploits and preserves the block diagonal structure of the discretized operator in stochastic collocation schemes. This disentangles computations of the spatial and parametric degrees of freedom in the TT representation. In particular, it only requires solving independent PDEs at a few parameter values, thus allowing the use of existing high performance PDE solvers. We benchmark the new algorithm on the stochastic diffusion equation against quasi-Monte Carlo and dimension-adaptive sparse grids methods. For sufficiently smooth random fields the new approach is orders of magnitude faster.

Abstract:

Co-authors: Robert Scheichl (University of Bath)

We consider the approximate solution of parametric PDEs using the low-rank Tensor Train (TT) decomposition. Such parametric PDEs arise for example in uncertainty quantification problems in engineering applications. We propose an algorithm that is a hybrid of the alternating least squares and the TT cross methods. It computes a TT approximation of the whole solution, which is particularly beneficial when multiple quantities of interest are sought. The new algorithm exploits and preserves the block diagonal structure of the discretized operator in stochastic collocation schemes. This disentangles computations of the spatial and parametric degrees of freedom in the TT representation. In particular, it only requires solving independent PDEs at a few parameter values, thus allowing the use of existing high performance PDE solvers. We benchmark the new algorithm on the stochastic diffusion equation against quasi-Monte Carlo and dimension-adaptive sparse grids methods. For sufficiently smooth random fields the new approach is orders of magnitude faster.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video *	640x360	1.94 Mbits/sec	714.48 MB	View	Download
WebM	640x360	428.69 kbits/sec	154.22 MB	View	Download
iPod Video	480x270	522.04 kbits/sec	187.74 MB	View	Download
MP3	44100 Hz	249.76 kbits/sec	89.91 MB	Listen	Download
Auto	(Allows browser to choose a format it supports)