Optimal segmented polynomial \(L_s\)-approximations

DOI10.1007/BF02243481zbMath0444.65010OpenAlexW143879262MaRDI QIDQ1144899

John B. Kioustelidis

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243481

zbMATH Keywords

algorithmfree knotsoptimal segmented polynomial approximations

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Spline approximation (41A15)

Related Items (1)

Unicity in piecewise polynomial 𝐿¹-approximation via an algorithm

Cites Work

• Uniform piecewise polynomial approximation with variable joints
• Characteristic properties of the segmented rational minmax approximation problem
• Best polynomial approximations: A corrected proof
• Zur Segmentapproximation mit Polynomen
• Unnamed Item

This page was built for publication: Optimal segmented polynomial \(L_s\)-approximations