Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fast Compact Algorithms and Software for Spline SmoothingIntroduction

Fast Compact Algorithms and Software for Spline Smoothing: Introduction [Once upon a time, the most difficult aspect of signal processing was acquiring enough data. Nowadays, one can sample at very high rates and collect huge data sets, but processing the data in a timely manner, without exceeding available memory, is challenging, despite continuing advances in computer technology. Meeting this challenge requires the full exploitation of mathematical structure to develop an algorithm that can be implemented efficiently in software.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fast Compact Algorithms and Software for Spline SmoothingIntroduction

Download PDF
3 pages

Loading next page...
 
/lp/springer-journals/fast-compact-algorithms-and-software-for-spline-smoothing-introduction-vsG1gc6MUS
Publisher
Springer New York
Copyright
© The Author(s) 2013
ISBN
978-1-4614-5495-3
Pages
1 –4
DOI
10.1007/978-1-4614-5496-0_1
Publisher site
See Chapter on Publisher Site

Abstract

[Once upon a time, the most difficult aspect of signal processing was acquiring enough data. Nowadays, one can sample at very high rates and collect huge data sets, but processing the data in a timely manner, without exceeding available memory, is challenging, despite continuing advances in computer technology. Meeting this challenge requires the full exploitation of mathematical structure to develop an algorithm that can be implemented efficiently in software.]

Published: Sep 18, 2012

Keywords: Slate Samples; True Mean Square; Generalized Cross Validation (GCV); Tridiagonal Toeplitz Matrix; Discrete Spline

There are no references for this article.