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 SmoothingDiscrete Spline Smoothing

Fast Compact Algorithms and Software for Spline Smoothing: Discrete Spline Smoothing [In this chapter we investigate Cholesky and FFT algorithms for discrete cubic spline smoothing, and we compare the performance of the continuous and discrete smoothers. Henderson [1] was the first to use Cholesky factorization for the discrete problem.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Fast Compact Algorithms and Software for Spline SmoothingDiscrete Spline Smoothing

Download PDF
9 pages

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

Abstract

[In this chapter we investigate Cholesky and FFT algorithms for discrete cubic spline smoothing, and we compare the performance of the continuous and discrete smoothers. Henderson [1] was the first to use Cholesky factorization for the discrete problem.]

Published: Sep 18, 2012

Keywords: Smoothing Spline; Discrete Spline; Discrete Problem; Cholesky Factorization; Fminbnd

There are no references for this article.