|
![]() |
|||
|
||||
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-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 2013 ed. Dimensions: Width: 15.50cm , Height: 0.20cm , Length: 23.50cm Weight: 0.454kg ISBN: 9781461454953ISBN 10: 1461454956 Pages: 45 Publication Date: 11 October 2012 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsIntroduction.- Cholesky Algorithm.- QR Algorithm.- FFT Algorithm.- Discrete Spline Smoothing.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |