A Remez type algorithm for spline functions

DOI10.1007/BF01396309zbMath0489.65011MaRDI QIDQ1166885

Günther Nürnberger, Manfred Sommer

Publication date: 1983

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

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

zbMATH Keywords

numerical examplesconvergence resultsexchange algorithmunique best approximationnearly best approximationRemez type algorithm

Mathematics Subject Classification ID

Numerical computation using splines (65D07) Best approximation, Chebyshev systems (41A50) Spline approximation (41A15)

Related Items

Strongly unique spline approximations with free knots ⋮ Shape-preserving knot removal ⋮ Bivariate segment approximation and free knot splines: Research Problems 96-4 ⋮ Alternation for best spline approximations ⋮ Continuous selections and convergence of best L_p–approximations in subspaces of spline functions ⋮ Parametric approximation by splines ⋮ Strong unicity of best approximations : A numerical aspect ⋮ On the Gauss transform of polynomial spline spaces ⋮ Algorithm for the best uniform spline approximation with free knots ⋮ Approximation in normed linear spaces ⋮ Algorithms for Piecewise Polynomials and Splines with Free Knots ⋮ An algorithm for the computation of strict approximations in subspaces of spline functions ⋮ A Remez type algorithm for generalized spline spaces

Cites Work

• Unnamed Item
• Alternation for best spline approximations
• A practical guide to splines
• Computational methods for best spline function approximation
• Equioscillation under nonuniqueness in the approximation of continuous functions
• A local version of haar's theorem in approximation theory