The computational cost of simplex spline functions

This paper presents a negative result concerning the stable evaluation of simplex spline functions. It has been conjectured that a great deal of computational effort might be saved by implementing the recurrence relation for these functions in a clever way. The main result of this paper is that there is no clever way to implement the recurrence relation once the standard recipe for constructing spaces of simplex spline functions has been followed.