Low rank methods for PDE-constrained optimization

41 mins 15 secs,  148.63 MB,  WebM  640x360,  29.97 fps,  44100 Hz,  491.94 kbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Stoll, M
Thursday 8th March 2018 - 11:45 to 12:30
 
Created: 2018-03-09 15:19
Collection: Uncertainty quantification for complex systems: theory and methodologies
Publisher: Isaac Newton Institute
Copyright: Stoll, M
Language: eng (English)
Distribution: World     (downloadable)
Explicit content: No
Aspect Ratio: 16:9
Screencast: No
Bumper: UCS Default
Trailer: UCS Default
 
Abstract: Optimization subject to PDE constraints is crucial in many applications . Numerical analysis has contributed a great deal to allow for the efficient solution of these problems and our focus in this talk will be on the solution of the large scale linear systems that represent the first order optimality conditions. We illustrate that these systems, while being of very large dimension, usually contain a lot of mathematical structure. In particular, we focus on low-rank methods that utilize the Kronecker product structure of the system matrices. These methods allow the solution of a time-dependent problem with the storage requirements of a small multiple of the steady problem. Furthermore, this technique can be used to tackle the added dimensionality when we consider optimization problems subject to PDEs with uncertain coefficients. The stochastic Galerkin FEM technique leads to a vast dimensional system that would be infeasible on any computer but using low-rank techniques this can be solved on a standard laptop computer.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 640x360    1.93 Mbits/sec 599.49 MB View Download
WebM * 640x360    491.94 kbits/sec 148.63 MB View Download
iPod Video 480x270    522.14 kbits/sec 157.69 MB View Download
MP3 44100 Hz 249.73 kbits/sec 75.51 MB Listen Download
Auto (Allows browser to choose a format it supports)