Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Fast Compact Algorithms and Software for Spline Smoothing

Fast Compact Algorithms and Software for Spline Smoothing

Weinert, Howard L.

Paperback

Series: Springerbriefs in Computer Science

Technology & EngineeringGeneral ComputersGeneral Mathematics

ISBN10: 1461454956
ISBN13: 9781461454953
Publisher: Springer Nature
Published: Oct 11 2012
Pages: 45
Weight: 0.20
Height: 0.12 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Mathematics

View All