Fast compact algorithms and software for spline smoothing.
From MaRDI portal
Recommendations
Cited in
(15)- Efficient computation for Whittaker-Henderson smoothing
- The generalized cross validation filter
- Fast generalized cross validation using Krylov subspace methods
- Smoothing splines using compactly supported, positive definite, radial basis functions
- Trend smoothness achieved by penalized least squares with the smoothing parameter chosen by optimality criteria
- A fast data smoothing algorithm
- scientific article; zbMATH DE number 4009564 (Why is no real title available?)
- scientific article; zbMATH DE number 1278311 (Why is no real title available?)
- Fast derivative computation using smooth X-splines
- scientific article; zbMATH DE number 2163921 (Why is no real title available?)
- scientific article; zbMATH DE number 1431771 (Why is no real title available?)
- WYPIWYG hyperelasticity for isotropic, compressible materials
- Efficient algorithms for robust generalized cross-validation spline smoothing
- Fast smoothing parameter separation in multidimensional generalized P-splines: the SAP algorithm
- A fast compact algorithm for cubic spline smoothing
This page was built for publication: Fast compact algorithms and software for spline smoothing.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911002)