Global and local data reduction strategies for cubic splines
From MaRDI portal
Publication:756911
DOI10.1016/0010-4485(91)90003-FzbMATH Open0723.65004OpenAlexW2040358113MaRDI QIDQ756911FDOQ756911
Authors: U. A. Wever
Publication date: 1991
Published in: CAD. Computer-Aided Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0010-4485(91)90003-f
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 (6)
- 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
- Method to determine optimum number of knots for cubic splines
- Cubic spline data reduction choosing the knots from a third derivative criterion
- Coefficient-based spline data reduction by hierarchical spaces
- Title not available (Why is that?)
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)