Bivariate segment approximation and free knot splines: Research Problems 96-4
From MaRDI portal
Publication:1357545
DOI10.1007/BF02437508zbMath0886.41010MaRDI QIDQ1357545
Publication date: 14 May 1998
Published in: Constructive Approximation (Search for Journal in Brave)
Related Items (9)
Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions ⋮ Characterization theorem for best polynomial spline approximation with free knots, variable degree and fixed tails ⋮ The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ Multivariate approximation by polynomial and generalized rational functions ⋮ Generalised rational approximation and its application to improve deep learning classifiers ⋮ Linear least squares problems involving fixed knots polynomial splines and their singularity study ⋮ Algorithm for the best uniform spline approximation with free knots ⋮ Approximation in normed linear spaces ⋮ Characterisation theorem for best polynomial spline approximation with free knots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bivariate segment approximation and splines
- Uniform approximation by generalized splines with free knots
- An algorithm for segment approximation
- Strongly unique spline approximations with free knots
- A Remez type algorithm for spline functions
- The metric projection for free knot splines
- A practical guide to splines
- Strong unicity in nonlinear approximation and free knot splines
- A second-order property of spline functions with one free knot
- On monosplines of least deviation
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- Chebyshev Approximation by Spline Functions with Free Knots
This page was built for publication: Bivariate segment approximation and free knot splines: Research Problems 96-4
