题    目：Sublinear Algorithm for Sparse Fourier Series

报 告 人：汪扬 教授
Department of Mathematics，Michigan State University
    
时    间：：2013年6月4日 下午 3:00-4:30

地    点：管理科研楼1218

摘    要：In this talk we consider the problem of reconstructing a signal with a small number of Fourier modes, ie a signal is sparse in the Fourier domain. Such a signal can be reconstructed easily by taking Fast Fourier Transform of the signal. In general FFT is considered a fast algorithm. However, when the bandwidth is very high even algorithms scaling linearly with the bandwidth might be too slow. Here we discuss a fast sublinear algorithm for reconstructing such signals.

主办单位：365英国上市官网         国家数学与交叉科学中心合肥分中心

       
欢迎感兴趣的师生参加！