Alternation for best spline approximations

DOI10.1007/BF01390213zbMath0489.65010MaRDI QIDQ1166884

Manfred Sommer, Günther Nürnberger

Publication date: 1983

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

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

zbMATH Keywords

unique best approximationHaar subspacesbest spline approximationsRemez 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 ⋮ Approximation by generalized splines ⋮ Chebyshev approximation of a multivariable function with reproducing the values of the function and its partial derivatives ⋮ A Remez type algorithm for spline functions ⋮ Knot removal for B-spline curves ⋮ Nonuniqueness and selections in spline approximation ⋮ A Remez type algorithm for generalized spline spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous selections and maximal alternators for spline approximation
• A Remez type algorithm for spline functions
• Eindeutigkeit bei der gleichmäßigen Approximation mit Tschebyscheffschen Splinefunktionen
• Characterization of continuous selections of the metric projection for spline functions
• On alternation numbers in nonlinear Chebyshev approximation
• Uniqueness and strong uniqueness of best approximations by spline subspaces and other subspaces
• Equioscillation under nonuniqueness in the approximation of continuous functions
• A characterization of pointwise-lipschitz-continuous selections for the metric projection
• A local version of haar's theorem in approximation theory
• Characterization of Chebyshev Approximations by Splines