An algorithm for segment approximation

DOI10.1007/BF01389652zbMath0569.65012MaRDI QIDQ1060802

Hans Strauss, Manfred Sommer, Günther Nürnberger

Publication date: 1986

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133082

zbMATH Keywords

algorithmbest approximationpiecewise polynomialssegment approximationpiecewise rational functions

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation by rational functions (41A20) Approximation by polynomials (41A10) Algorithms for approximation of functions (65D15)

Related Items (9)

Shape-preserving knot removal ⋮ Bivariate segment approximation and free knot splines: Research Problems 96-4 ⋮ Bivariate segment approximation and splines ⋮ Some results in segmented approximation ⋮ Increasing the efficiency of Chebyshev segment fractional rational approximation ⋮ Detection of Singularities Using Segment Approximation ⋮ On a certain duality for segmented minmax problems ⋮ Approximation in normed linear spaces ⋮ Algorithms for Piecewise Polynomials and Splines with Free Knots

Cites Work

• Uniform approximation by generalized splines with free knots
• A practical guide to splines
• Uniform piecewise polynomial approximation with variable joints
• Characteristic properties of the segmented rational minmax approximation problem
• On the approximation of curves by line segments using dynamic programming
• Partition Regression
• Curve Fitting with Piecewise Polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for segment approximation