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

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Weinert, Howard L. (Auteur)
Collectivité auteur: SpringerLink (Online service)
Format: Électronique eBook
Langue:Inglés
Publié: New York, NY : Springer New York : Imprint: Springer, 2013.
Édition:1st ed. 2013.
Collection:SpringerBriefs in Computer Science,
Sujets:
Mathematical statistics-Data processing.
Signal processing.
Mathematics-Data processing.
Engineering mathematics.
Engineering-Data processing.
Computer software.
Statistics and Computing.
Signal, Speech and Image Processing .
Computational Science and Engineering.
Mathematical and Computational Engineering Applications.
Mathematical Software.
Accès en ligne:Texto Completo
Table des matières:
  • Introduction
  • Cholesky Algorithm
  • QR Algorithm
  • FFT Algorithm
  • Discrete Spline Smoothing.

Documents similaires