Global and local data reduction strategies for cubic splines
type: Item
instance of: scholarly article
title: Global and local data reduction strategies for cubic splines
zbMATH Open document ID: 0723.65004
DOI: 10.1016/0010-4485(91)90003-F
author: U. A. Wever
published in: CAD. Computer-Aided Design
publication date: 1991-01-01T00:00:00Z
review text: 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.
reviewed by: Edward Neuman
Mathematics Subject Classification ID: 65D07
Mathematics Subject Classification ID: 41A15
zbMATH DE Number: 4192934
zbMATH Keywords: data reduction strategies
zbMATH Keywords: knot number minimization
zbMATH Keywords: cubic spline
zbMATH Keywords: Numerical examples
MaRDI profile type: Publication
full work available at URL: 0010-4485(91)90003-f
OpenAlex ID: W2040358113
Recommended article: A Data-Reduction Strategy for Splines with Applications to the Approximation of Functions and Data
Recommended article: A comparative analysis of local cubic splines
Recommended article: Q3478934
Recommended article: Q5261987
Recommended article: Coefficient-based spline data reduction by hierarchical spaces
Recommended article: A local algorithm for constructing non-negative cubic splines
Recommended article: Q3561571
Recommended article: Cubic spline data reduction choosing the knots from a third derivative criterion
Recommended article: Q4308355
description: scientific article; zbMATH DE number 4192934