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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Weinert, Howard L. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2013.
Edición:1st ed. 2013.
Colección:SpringerBriefs in Computer Science,
Temas:
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.
Acceso en línea:Texto Completo
Descripción
Sumario: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.
Descripción Física:VIII, 45 p. 7 illus., 5 illus. in color. online resource.
ISBN:9781461454960
ISSN:2191-5776

Ejemplares similares