ENGLISH

Fast Compact Algorithms and Software for Spline Smoothing

By Howard L. Weinert (auth.)

Book information

Publisher
Springer-Verlag New York
Year
2013
ISBN
978-1-4614-5495-3
DOI
10.1007/978-1-4614-5496-0
ISSN
2191-576
Language
english
Format
PDF
Filesize
416 kB (426373 bytes)
Series
SpringerBriefs in Computer Science
Edition
1
Pages
45\53
Orientation
yes
Paginated
yes
Scanned
portrait
Time added
2013-04-30 14:10:47
Image and Speech Processing; Computational ScienceStatistics and Computing/Statistics Programs; Sign

Description

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.

Similar books