Efficient computation for Whittaker–Henderson smoothing

Efficient algorithms that compute both the estimates and the generalized cross-validation score for the problem of Whittaker–Henderson smoothing are presented. Algorithm efficiency results from carefully exploiting the problem's rich structure to reduce execution time and memory use. The algorithms are much faster than existing ones, and use significantly less memory. MATLAB M-files are included.