Iterative algorithms in irregular sampling: a first comparison of methods

The authors discuss a series of numerical experiments, aiming at the comparison of several iterative algorithms designed to reconstruct band-limited signals from irregularly spaced samples. The authors give a short description of these algorithms and then discuss possible criteria for the quality or performance of these algorithms. It turns out that appropriate criteria for such an evaluation are more involved than one might think from the literature. Among the properties discussed are various notions of speed, measures of the stability of the reconstruction algorithms and the range in which complete reconstruction is performed. The authors concentrate on the representation of the one-dimensional problems, although the underlying theory has been developed for several dimensions. Only qualitative statements are given.<
>