Javascript must be enabled

Haizhao Yang : Data-driven fast algorithms in applied harmonic analysis and numerical linear algebra



Exploring data structures (e.g, periodicity, sparsity, low-rankness) is a universal method in designing fast algorithms in scientific computing. In the first part of this talk, I will show how this idea is applied to the analysis of oscillatory data in applied harmonic analysis. These fast algorithms have been applied to data analysis ranging from materials science, medicine, and art. In the second part, I will discuss how this idea works in some basic numerical linear algebra routines like matrix multiplications and decompositions, with an emphasis in electronic structure calculation.

Please select playlist name from following

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.


Comments Disabled For This Video