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

Full description

Bibliographic Details
Main Author: Weinert, Howard L. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language:English
Published: New York, NY : Springer New York : Imprint: Springer, 2013.
Series:SpringerBriefs in Computer Science,
Subjects:
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-1-4614-5496-0
LEADER 02503nam a22005175i 4500
001 13341
003 DE-He213
005 20130727060032.0
007 cr nn 008mamaa
008 121026s2013 xxu| s |||| 0|eng d
020 # # |a 9781461454960  |9 978-1-4614-5496-0 
024 7 # |a 10.1007/978-1-4614-5496-0  |2 doi 
050 # 4 |a QA276-280 
072 # 7 |a UFM  |2 bicssc 
072 # 7 |a COM077000  |2 bisacsh 
082 0 4 |a 519.5  |2 23 
100 1 # |a Weinert, Howard L.  |e author. 
245 1 0 |a Fast Compact Algorithms and Software for Spline Smoothing  |c by Howard L. Weinert.  |h [electronic resource] / 
264 # 1 |a New York, NY :  |b Springer New York :  |b Imprint: Springer,  |c 2013. 
300 # # |a VIII, 45 p. 7 illus., 5 illus. in color.  |b online resource. 
336 # # |a text  |b txt  |2 rdacontent 
337 # # |a computer  |b c  |2 rdamedia 
338 # # |a online resource  |b cr  |2 rdacarrier 
347 # # |a text file  |b PDF  |2 rda 
490 1 # |a SpringerBriefs in Computer Science,  |x 2191-5768 
505 0 # |a Introduction -- Cholesky Algorithm -- QR Algorithm -- FFT Algorithm -- Discrete Spline Smoothing. 
520 # # |a 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. 
650 # 0 |a Statistics. 
650 # 0 |a Computer science. 
650 # 0 |a Computer software. 
650 # 0 |a Mathematical statistics. 
650 # 0 |a Engineering mathematics. 
650 1 4 |a Statistics. 
650 2 4 |a Statistics and Computing/Statistics Programs. 
650 2 4 |a Signal, Image and Speech Processing. 
650 2 4 |a Computational Science and Engineering. 
650 2 4 |a Appl.Mathematics/Computational Methods of Engineering. 
650 2 4 |a Mathematical Software. 
710 2 # |a SpringerLink (Online service) 
773 0 # |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9781461454953 
830 # 0 |a SpringerBriefs in Computer Science,  |x 2191-5768 
856 4 0 |u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-1-4614-5496-0 
912 # # |a ZDB-2-SCS 
950 # # |a Computer Science (Springer-11645)