|
![]() |
|||
|
||||
OverviewFast 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. Full Product DetailsAuthor: Howard L WeinertPublisher: Springer New York Imprint: Springer New York ISBN: 9781283908016ISBN 10: 1283908018 Pages: 53 Publication Date: 01 January 2013 Audience: General/trade , General Format: Electronic book text Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |