Pages that link to "Item:Q1060802"
From MaRDI portal
The following pages link to An algorithm for segment approximation (Q1060802):
Displaying 18 items.
- A fast segmentation algorithm for piecewise polynomial numeric function generators (Q548302) (← links)
- Bivariate segment approximation and splines (Q675684) (← links)
- Some results in segmented approximation (Q678443) (← links)
- Increasing the efficiency of Chebyshev segment fractional rational approximation (Q681730) (← links)
- On the number of segments needed in a piecewise linear approximation (Q964964) (← links)
- Algorithms for the optimal identification of segment neighborhoods (Q1111966) (← links)
- On a certain duality for segmented minmax problems (Q1271534) (← links)
- Shape-preserving knot removal (Q1350836) (← links)
- Bivariate segment approximation and free knot splines: Research Problems 96-4 (Q1357545) (← links)
- A Newton-type method for computing best segment approximations (Q1429991) (← links)
- Approximation in normed linear spaces (Q1587393) (← links)
- Piecewise linear approximation by the method of worst segment division (Q2062105) (← links)
- Algorithms for Fast Digital Straight Segments Union (Q3190094) (← links)
- (Q3538100) (← links)
- Algorithms for Piecewise Polynomials and Splines with Free Knots (Q3821081) (← links)
- (Q3974275) (← links)
- Detection of Singularities Using Segment Approximation (Q4031578) (← links)
- (Q4949360) (← links)