Fast Compact Algorithms and Software for Spline Smoothing electronic resource by Howard L. Weinert.
Material type: TextSeries: SpringerBriefs in Computer SciencePublication details: New York, NY : Springer New York : Imprint: Springer, 2013Description: VIII, 45 p. 7 illus., 5 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9781461454960Subject(s): Statistics | Computer Science | Computer software | Mathematical statistics | Engineering mathematics | Statistics | Statistics and Computing/Statistics Programs | Signal, Image and Speech Processing | Computational Science and Engineering | Appl.Mathematics/Computational Methods of Engineering | Mathematical SoftwareDDC classification: 519.5 LOC classification: QA276-280Online resources: Click here to access onlineIntroduction -- Cholesky Algorithm -- QR Algorithm -- FFT Algorithm -- Discrete 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, 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.
There are no comments on this title.