Fast Compact Algorithms and Software for Spline Smoothing

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, Q...

Full description

Bibliographic Details
Main Author: Weinert, Howard L.
Format: eBook
Language:English
Published: New York, NY Springer New York 2013, 2013
Edition:1st ed. 2013
Series:SpringerBriefs in Computer Science
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Description
Summary: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
Physical Description:VIII, 45 p. 7 illus., 5 illus. in color online resource
ISBN:9781461454960