PORTALE DELLA DIDATTICA

PORTALE DELLA DIDATTICA

PORTALE DELLA DIDATTICA

Elenco notifiche



Integral operators and fast solvers: a cross-disciplinary excursus on the best of FFT'companions

01UJDRV

A.A. 2019/20

Course Language

Inglese

Degree programme(s)

Doctorate Research in Ingegneria Elettrica, Elettronica E Delle Comunicazioni - Torino

Course structure
Teaching Hours
Lezioni 20
Lecturers
Teacher Status SSD h.Les h.Ex h.Lab h.Tut Years teaching
Andriulli Francesco Paolo   Professore Ordinario IINF-02/A 20 0 0 0 3
Co-lectures
Espandi

Context
SSD CFU Activities Area context
*** N/A *** 4    
2019/20
PERIOD: MAY - JUNE The discovery of the Fast Fourier Transform (FFT), the fast algorithm to compute the Discrete Fourier Transform, can rightly be considered as one of the most technology-enabling milestones in computational science. The FFT reduces the computational complexity of Fourier analysis from quadratic to (quasi) linear-in-the-length-of-the-signal and it has profoundly impacted several disciplines both in applied science and engineering. One could wonder whether the existence of the FFT is a fortunate, but isolate case or if other technology-enabling “transforms” exist that allow fast algorithms. This course will answer to this question and will take the audience into an exciting journey through the most powerful fast schemes and their stunning multidisciplinary applications. After the introduction of some fundamental and powerful tools from Computational Science & Engineering, the course will present the most relevant and impacting fast algorithms emerging from various disciplines of engineering and applied science. Then the course will focus on a cross-disciplinary selection of applications including models in electric neuroimaging, gravitation, electromagnetics, and applied solid state physics. Theory will be balanced with hands-on computational activities. Prerequisites are limited to standard real analysis and basic programming skills (in any language). Final grades will be based on class participation and on the oral presentation of a final report.
PERIOD: MAY - JUNE The discovery of the Fast Fourier Transform (FFT), the fast algorithm to compute the Discrete Fourier Transform, can rightly be considered as one of the most technology-enabling milestones in computational science. The FFT reduces the computational complexity of Fourier analysis from quadratic to (quasi) linear-in-the-length-of-the-signal and it has profoundly impacted several disciplines both in applied science and engineering. One could wonder whether the existence of the FFT is a fortunate, but isolate case or if other technology-enabling “transforms” exist that allow fast algorithms. This course will answer to this question and will take the audience into an exciting journey through the most powerful fast schemes and their stunning multidisciplinary applications. After the introduction of some fundamental and powerful tools from Computational Science & Engineering, the course will present the most relevant and impacting fast algorithms emerging from various disciplines of engineering and applied science. Then the course will focus on a cross-disciplinary selection of applications including models in electric neuroimaging, gravitation, electromagnetics, and applied solid state physics. Theory will be balanced with hands-on computational activities. Prerequisites are limited to standard real analysis and basic programming skills (in any language). Final grades will be based on class participation and on the oral presentation of a final report.
Introductory concepts in Computational Science and Computational Engineering The Discrete Fourier Transform and the FFT Butterfly Algorithm Discretization methods for linear operators An hands-on introduction to LAPACK and other computational libraries An excursus on relevant integral operators and transforms The Fast Gauss Transform Static and dynamic Fast Multipole Methods H-Matrix Algebras and Kernel Free Fast Methods Analysis of selected applications from Computational Neuroimaging, Computational Astrophysics, Computational Electromagnetics, Computational Thermodynamics, and Computational Solid State Physics.
Introductory concepts in Computational Science and Computational Engineering The Discrete Fourier Transform and the FFT Butterfly Algorithm Discretization methods for linear operators An hands-on introduction to LAPACK and other computational libraries An excursus on relevant integral operators and transforms The Fast Gauss Transform Static and dynamic Fast Multipole Methods H-Matrix Algebras and Kernel Free Fast Methods Analysis of selected applications from Computational Neuroimaging, Computational Astrophysics, Computational Electromagnetics, Computational Thermodynamics, and Computational Solid State Physics.
Modalità di esame:
Exam:
...
Gli studenti e le studentesse con disabilità o con Disturbi Specifici di Apprendimento (DSA), oltre alla segnalazione tramite procedura informatizzata, sono invitati a comunicare anche direttamente al/la docente titolare dell'insegnamento, con un preavviso non inferiore ad una settimana dall'avvio della sessione d'esame, gli strumenti compensativi concordati con l'Unità Special Needs, al fine di permettere al/la docente la declinazione più idonea in riferimento alla specifica tipologia di esame.
Exam:
In addition to the message sent by the online system, students with disabilities or Specific Learning Disorders (SLD) are invited to directly inform the professor in charge of the course about the special arrangements for the exam that have been agreed with the Special Needs Unit. The professor has to be informed at least one week before the beginning of the examination session in order to provide students with the most suitable arrangements for each specific type of exam.
Esporta Word