Computing periodic conformal mappings

32 mins 9 secs,  58.82 MB,  MP3  44100 Hz,  249.77 kbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Baddoo, P
Friday 13th December 2019 - 15:00 to 15:30
 
Created: 2019-12-16 12:54
Collection: Complex analysis: techniques, applications and computations
Publisher: Isaac Newton Institute
Copyright: Baddoo, P
Language: eng (English)
Distribution: World     (downloadable)
Explicit content: No
Aspect Ratio: 16:9
Screencast: No
Bumper: UCS Default
Trailer: UCS Default
 
Abstract: Conformal mappings are used to model a range of phenomena in the physical sciences. Although the Riemann mapping theorem guarantees the existence of a mapping between two conformally equivalent domains, actually constructing these mappings is extremely challenging. Moreover, even when the mapping is known in principle, an efficient representation is not always available. Accordingly, we present techniques for rapidly computing the conformal mapping from a multiply connected canonical circular domain to a periodic array of polygons. The boundary correspondence function is found by solving the parameter problem for a new periodic Schwarz--Christoffel formula. We then represent the mapping using rational function approximation. To this end, we present a periodic analogue of the adaptive Antoulas--Anderson (AAA) algorithm to obtain the relevant support points and weights. The procedure is extremely fast; evaluating the mappings typically takes around 10 microseconds. Finally, we leverage the new algorithms to solve problems in fluid mechanics in periodic domains.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 640x360    1.93 Mbits/sec 467.51 MB View Download
WebM 640x360    767.48 kbits/sec 180.72 MB View Download
iPod Video 480x270    521.89 kbits/sec 122.89 MB View Download
MP3 * 44100 Hz 249.77 kbits/sec 58.82 MB Listen Download
Auto (Allows browser to choose a format it supports)