Global and local data reduction strategies for cubic splines
From MaRDI portal
Publication:756911
The author proposes two algorithms which allow the user to minimize the number of knots of an approximating cubic spline s. The cubic spline is forced to satisfy \(y_ i-a_ i\leq s(x_ i)\leq y_ i+b_ i\quad 1\leq i\leq n,\) where \((x_ i,y_ i)\) are the given points and \((a_ i,b_ i)\) are assumed nonnegative tolerances. Numerical examples are included.
Recommendations
- A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data
- A comparative analysis of local cubic splines
- scientific article; zbMATH DE number 4148815
- scientific article; zbMATH DE number 6456799
- Coefficient-based spline data reduction by hierarchical spaces
- A local algorithm for constructing non-negative cubic splines
- The local integro cubic spline and its approximation properties
- Cubic spline data reduction choosing the knots from a third derivative criterion
- scientific article; zbMATH DE number 647616
Cited in
(7)- Coefficient-based spline data reduction by hierarchical spaces
- Method to determine optimum number of knots for cubic splines
- Three adaptive discrete least squares cubic spline procedures for the compression of data
- A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data
- scientific article; zbMATH DE number 4098599 (Why is no real title available?)
- An algorithm for data reduction using splines with free knots
- Cubic spline data reduction choosing the knots from a third derivative criterion
This page was built for publication: Global and local data reduction strategies for cubic splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756911)