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. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: New York, NY : Springer New York : Imprint: Springer, 2013.
Series:SpringerBriefs in Computer Science,
Subjects:
Online Access:Full Text via HEAL-Link
Table of Contents:
  • Introduction
  • Cholesky Algorithm
  • QR Algorithm
  • FFT Algorithm
  • Discrete Spline Smoothing.