© 2013

Fast Compact Algorithms and Software for Spline Smoothing


Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Howard L. Weinert
    Pages 1-4
  3. Howard L. Weinert
    Pages 5-18
  4. Howard L. Weinert
    Pages 19-28
  5. Howard L. Weinert
    Pages 29-35
  6. Howard L. Weinert
    Pages 37-45

About this book


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.


Cross-validation Graduation Interpolation Smoothing Spline

Authors and affiliations

  1. 1., Department of Electrical andJohns Hopkins UniversityBALTIMOREUSA

Bibliographic information

Industry Sectors
Finance, Business & Banking
IT & Software
Consumer Packaged Goods
Oil, Gas & Geosciences