科研之友
微信
新浪微博
Facebook
分享链接
摘要
A fast multilevel algorithm (MuST) for evaluating an n-sample sinc interpolant at mn points is presented. For uniform grids, its complexity is 25mnlog(1/delta) flops for the sinc kernel and 75mnlog(1/delta) for the sincd kernel, where delta is the target evaluation accuracy. MuST is faster than FFT- and FMM-based evaluations for large n and/or for large delta. It is also applicable to nonuniform grids and to other kernels. Numerical experiments demonstrating the algorithm's practicality are presented.
- 出版日期2011
