TY  - BOOK
AU  - Weinert,Howard L.
ED  - SpringerLink (Online service)
TI  - Fast Compact Algorithms and Software for Spline Smoothing
T2  - SpringerBriefs in Computer Science,
SN  - 9781461454960
AV  - QA276-280 
U1  - 519.5 23
PY  - 2013///
CY  - New York, NY
PB  - Springer New York, Imprint: Springer
KW  - Statistics
KW  - Computer mathematics
KW  - Computer software
KW  - Applied mathematics
KW  - Engineering mathematics
KW  - Statistics and Computing/Statistics Programs
KW  - Signal, Image and Speech Processing
KW  - Computational Science and Engineering
KW  - Appl.Mathematics/Computational Methods of Engineering
KW  - Mathematical Software
N1  - Introduction -- Cholesky Algorithm -- QR Algorithm -- FFT Algorithm -- Discrete Spline Smoothing
N2  - Fast Compact Algorithms and Software for Spline Smoothing investigates algorithmic alternatives for computing cubic smoothing splines when the amount of smoothing is determined automatically by minimizing the generalized cross-validation score. These algorithms are based on Cholesky factorization, QR factorization, or the fast Fourier transform. All algorithms are implemented in MATLAB and are compared based on speed, memory use, and accuracy. An overall best algorithm is identified, which allows very large data sets to be processed quickly on a personal computer
UR  - http://dx.doi.org/10.1007/978-1-4614-5496-0
ER  -