A fast compact algorithm for cubic spline smoothing
From MaRDI portal
Publication:961215
DOI10.1016/j.csda.2008.10.036zbMath1452.62140MaRDI QIDQ961215
Publication date: 30 March 2010
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2008.10.036
62-08: Computational methods for problems pertaining to statistics
65D07: Numerical computation using splines
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient computation for Whittaker-Henderson smoothing
- A stochastic framework for recursive computation of spline functions. II: Smoothing splines
- Smoothing by spline functions.
- A fast algorithm for signal extraction, influence and cross-validation in state space models
- Algorithm 547: Fortran Routines for Discrete Cubic Spline Interpolation and Smoothing [E1, [E3]]
- B-spline signal processing. II. Efficiency design and applications
- Discrete Interpolating and Smoothing Spline Functions
- Self-Similarity: Part I—Splines and Operators
- Smoothing noisy data with spline functions
- Fast spline smoothing via spectral factorization concepts