Gridding: Exploring an Efficient Numerical Algorithm for 0-Th Order Prolate Spheroidal Wave Function Evaluation as Convolution Kernel

Keywords

accuracy allow alternative alternatives appear application approaches appropriately approximating approximation argument attenuation band bandwidth bandwidths bell best biomedical call calls checks close coefficients components computation computational compute computed computer computing concentrating conditional continuous convolution correct corrected correction correspondingly described determine developed digital displayed distributed domains dover easy efficient eigenvector either estimation evaluating evaluation even examples explore exploring external fast features filters finite function functions give grid implementation implemented implies instance instead introduced involve involving just kaiser kernel kind known look material mathematical multiplication necessary needs normally noting numerical numerically offering operations opted originally polynomial polynomials post problems processes product profile profiles prolate property reasonably recently reconstructed reconstruction recurrence relation represent represents reproduce root samples sampling scaled schemes seem series soon space special specified spherical spheroidal square step stored stretched stretching subroutine symmetry system table target tech thanks trans transform transformation truncated trust uniform uniformly version viable wave width window windows worth