MuST: the multilevel sinc transform. 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/δ) flops for the sinc kernel and 75mnlog(1/δ) for the sincd kernel, where δ is the target evaluation accuracy. MuST is faster than fast Fourier transform- and fast multiple method-based evaluations for large n and/or for large δ. It is also applicable to nonuniform grids and to other kernels. Numerical experiments demonstrating the algorithm’s practicality are presented.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Trynin, A.Yu.: On necessary and sufficient conditions for convergence of sinc-approximations (2016)
- Trynin, A.Yu.: Necessary and sufficient conditions for the uniform on a segment sinc-approximations functions of bounded variation (2016)
- Livne, Oren E.; Brandt, Achi E.: MuST: the multilevel sinc transform (2011)