Computational methods for best spline function approximation

DOI10.1016/0021-9045(69)90033-1zbMath0181.17604OpenAlexW1984297154MaRDI QIDQ2534809

R. E. Esch, W. L. Eastman

Publication date: 1969

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(69)90033-1

zbMATH Keywords

numerical analysis

Related Items (14)

COMPUTATIONAL METHODS FOR DISCRETE PARAMETRIC ℓ₁ AND ℓ_∞ CURVE FITTING ⋮ A Remez type algorithm for spline functions ⋮ Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen ⋮ Applications of fuzzy sets in curve fitting ⋮ Computational methods for best spline function approximation ⋮ Chebyshev approximation by spline functions with free knots ⋮ Minimum error bounds for multidimensional spline approximation ⋮ Discrete Tchebycheff approximation for multivariate splines ⋮ Algorithm for the best uniform spline approximation with free knots ⋮ On a map from the splines into a positive cone with applications ⋮ Piecewise linear Chebyshev approximation of planar curves ⋮ Uniform piecewise polynomial approximation with variable joints ⋮ Approximation in normed linear spaces ⋮ Methods for determining node location in asymptotically uniform spline approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational methods for best spline function approximation
• Characteristic properties of the segmented rational minmax approximation problem
• A Rapidly Convergent Descent Method for Minimization
• A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
• The Chebyshev Polynomial of Best Approximation to a Given Function on an Interval
• A Note on Numerical Procedures for Approximation by Spline Functions
• Characterization of Chebyshev Approximations by Splines

This page was built for publication: Computational methods for best spline function approximation