Global and local data reduction strategies for cubic splines (Q756911)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Global and local data reduction strategies for cubic splines |
scientific article; zbMATH DE number 4192934
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global and local data reduction strategies for cubic splines |
scientific article; zbMATH DE number 4192934 |
Statements
Global and local data reduction strategies for cubic splines (English)
0 references
1991
0 references
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.
0 references
data reduction strategies
0 references
knot number minimization
0 references
cubic spline
0 references
Numerical examples
0 references
0.8932671
0 references
0.88531387
0 references
0.86912364
0 references
0.86899436
0 references
0.8688276
0 references
