Results 1 
2 of
2
On the evaluation of box splines
"... The first (and for some still the only) multivariate Bspline is what today one would call the simplex spline, since it is derived from a simplex, and in distinction to other polyhedral splines, such as the cone spline and the box spline. The simplex spline was first talked about in 1976. However, i ..."
Abstract

Cited by 155 (8 self)
 Add to MetaCart
The first (and for some still the only) multivariate Bspline is what today one would call the simplex spline, since it is derived from a simplex, and in distinction to other polyhedral splines, such as the cone spline and the box spline. The simplex spline was first talked about in 1976. However, it was only after Micchelli [Micchelli, 1980] established recurrence relations for them that the topic of simplex splines and other multivariate Bsplines really took o. Their cousins, the box splines, were thought particularly attractive because their recurrence relations turned out to be very simple indeed. It was, therefore, a shock to me when, in the process of doing my bit on the book [de Boor, Hollig, Riemenschneider, 1993], I found that it was nontrivial to make effective use of these recurrence relations. It is one purpose of this note to relate my difficulties and how I tried to deal with them. This is not the place to give an introduction to box spline theory, nor to review the relevant literature. Rather, the reader is urged to consult [de Boor, Hollig, Riemenschneider, 1993] for missing details and the proper literature references (as well as for many illustrations, two of which are reproduced below).
Fast Fourier transforms for nonequispaced data: A tutorial
, 2000
"... In this section, we consider approximative methods for the fast computation of multivariate discrete Fourier transforms for nonequispaced data (NDFT) in the time domain and in the frequency domain. In particular, we are interested in the approximation error as function of the arithmetic complexity o ..."
Abstract

Cited by 110 (32 self)
 Add to MetaCart
In this section, we consider approximative methods for the fast computation of multivariate discrete Fourier transforms for nonequispaced data (NDFT) in the time domain and in the frequency domain. In particular, we are interested in the approximation error as function of the arithmetic complexity of the algorithm. We discuss the robustness of NDFTalgorithms with respect to roundoff errors and apply NDFTalgorithms for the fast computation of Bessel transforms.