An algorithm for a constrained P-spline
From MaRDI portal
Cites work
- A linear algebra approach to HP-splines frequency parameter selection
- A practical guide to splines
- A statistical perspective on ill-posed inverse problems (with discussion)
- Bayesian spectral density estimation using P-splines with quantile-based knot placement
- Bounding the Lebesgue constant for Berrut's rational interpolant at general nodes
- Constrained approximation by splines with free knots
- Density estimation and comparison with a penalized mixture approach
- Flexible smoothing with B-splines and penalties. With comments and a rejoinder by the authors
- Foundations of spline theory: B-splines, spline approximation, and hierarchical refinement
- On constrained smoothing and out-of-range prediction using P-splines: a conic optimization approach
- On the Lebesgue constant of barycentric rational interpolation at equidistant nodes
- On the Lebesgue constant of the trigonometric Floater-Hormann rational interpolant at equally spaced nodes
- Penalized hyperbolic-polynomial splines
- Reproduction capabilities of penalized hyperbolic-polynomial splines
- Smoothing by spline functions.
- Smoothing splines. Methods and applications
- SPLINE FUNCTIONS AND THE PROBLEM OF GRADUATION
- Spline smoothing under constraints on derivatives
- Splines with Nonnegative B-Spline Coefficients
- Twenty years of P-splines (invited article)
This page was built for publication: An algorithm for a constrained P-spline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972094)