Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Fast Compact Algorithms and Software for Spline Smoothing, Paperback / softback Book

Fast Compact Algorithms and Software for Spline Smoothing Paperback / softback

Part of the SpringerBriefs in Computer Science series

Paperback / softback

Description

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.

Information

Other Formats

Save 14%

£26.99

£23.09

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

Also in the SpringerBriefs in Computer Science series  |  View all