Efficient Computer Manipulation of Tensor Products
Carl de Boor · ACM Transactions on Mathematical Software · 1979
It is shown how to construct a modified version sub i of a (presumably efficient) subroutine sub i for solving the linear system A sub i x = b , i=1,...,k, so that the linear system can be solved by just one call to each of the subroutines SUB sub i . i=1,...,k. Polynomial interpolation and spline interpolation in several variables are given as examples. (Author)