The problem to determine partitions of a given rectangle which are optimal for segment approximation (e.g., by bivariate piecewise polynomials) is investigated. We give criteria for optimal partitions and develop algorithms for computing optimal partitions of certain types. It is shown that there is a surprising relationship between various types of optimal partitions. In this way, we obtain good partitions for interpolation by tensor product spline spaces. Our numerical examples show that the methods work efficiently.
Recommendations
Cites work
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- An algorithm for segment approximation
- Best approximation by free knot splines
- Characteristic properties of the segmented rational minmax approximation problem
- Chebyshev polynomials of several variables
- Detection of Singularities Using Segment Approximation
- scientific article; zbMATH DE number 44570 (Why is no real title available?)
- scientific article; zbMATH DE number 44907 (Why is no real title available?)
- scientific article; zbMATH DE number 740121 (Why is no real title available?)
- scientific article; zbMATH DE number 3244284 (Why is no real title available?)
- On multivariate polynomials of least deviation from zero on the unit cube
Cited in
(9)- Bivariate segment approximation and free knot splines: Research Problems 96-4
- Approximation in normed linear spaces
- On univariate and bivariate polynomial spline approximation
- scientific article; zbMATH DE number 1284036 (Why is no real title available?)
- scientific article; zbMATH DE number 4118885 (Why is no real title available?)
- scientific article; zbMATH DE number 884964 (Why is no real title available?)
- An expansion of bivariate spline functions
- An approximation algorithm for optimal piecewise linear interpolations of bounded variable products
- Extrema detection of bivariate spline functions
This page was built for publication: Bivariate segment approximation and splines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675684)