BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Fast Compact Algorithms and Software For Spline Smoothing

Fast Compact Algorithms and Software For Spline Smoothing

Fast Compact Algorithms and Software For Spline Smoothing
Stock photo: cover may vary

Fast Compact Algorithms and Software For Spline Smoothing Paperback - 2012 - 2013th Edition

by Weinert, Howard L,

Add to wish list
  • Used
New

Description

like new.
Ask the seller a question Add to wish list
A$89.51
A$5.66 Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Ships from GreatBookPrices (Maryland, United States)

Details

  • Title Fast Compact Algorithms and Software For Spline Smoothing
  • Author Weinert, Howard L,
  • Binding Paperback
  • Edition number 2013th
  • Edition 2013
  • Condition New
  • Pages 45
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2012-10-11
  • Illustrated Yes
  • Features Illustrated
  • Bookseller's Inventory # 18989401
  • ISBN 9781461454953 / 1461454956
  • Weight 0.2 lbs (0.09 kg)
  • Dimensions 9.21 x 6.14 x 0.12 in (23.39 x 15.60 x 0.30 cm)
  • Themes
    • Aspects (Academic): Applied/Practical
  • Category Mathematics
  • Library of Congress Catalogue Number 2012948342
  • Dewey Decimal Code 621.382
  • Quantity available 5

About GreatBookPrices Maryland, United States

Biblio member since 2024

Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from GreatBookPrices

Reader reviews for Fast Compact Algorithms and Software For Spline Smoothing

From the publisher

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