An algorithm for segment approximation

DOI10.1007/BF01389652MaRDI QIDQ1060802zbMATH OpenFDO

Authors Günther Nürnberger, M. Sommer, Hans Strauss

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

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

Recommendations

• Algorithms for Piecewise Polynomials and Splines with Free Knots
• Some results in segmented approximation
• On the Best Least Squares Approximation of Continuous Functions using Linear Splines with Free Knots
• scientific article; zbMATH DE number 3990026
• scientific article; zbMATH DE number 3844314

Cites work

• scientific article; zbMATH DE number 3690528 (Why is no real title available?)
• scientific article; zbMATH DE number 3755766 (Why is no real title available?)
• scientific article; zbMATH DE number 3759432 (Why is no real title available?)
• scientific article; zbMATH DE number 3244284 (Why is no real title available?)
• A practical guide to splines
• Characteristic properties of the segmented rational minmax approximation problem
• Curve Fitting with Piecewise Polynomials
• On the approximation of curves by line segments using dynamic programming
• Partition Regression
• Uniform approximation by generalized splines with free knots
• Uniform piecewise polynomial approximation with variable joints

Cited in

(20)

• scientific article; zbMATH DE number 1440917 (Why is no real title available?)
• scientific article; zbMATH DE number 11347 (Why is no real title available?)
• A fast segmentation algorithm for piecewise polynomial numeric function generators
• A Newton-type method for computing best segment approximations
• On a certain duality for segmented minmax problems
• Approximation in normed linear spaces
• On the number of segments needed in a piecewise linear approximation
• Piecewise linear approximation by the method of worst segment division
• scientific article; zbMATH DE number 3871984 (Why is no real title available?)
• Algorithms for Piecewise Polynomials and Splines with Free Knots
• Detection of Singularities Using Segment Approximation
• Shape-preserving knot removal
• Algorithms for Fast Digital Straight Segments Union
• scientific article; zbMATH DE number 5371223 (Why is no real title available?)
• Bivariate segment approximation and free knot splines: Research Problems 96-4
• Algorithms for the optimal identification of segment neighborhoods
• External estimation of a segment function by a polynomial strip
• Bivariate segment approximation and splines
• Some results in segmented approximation
• Increasing the efficiency of Chebyshev segment fractional rational approximation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060802)