Characteristic properties of the segmented rational minmax approximation problem

DOI10.1007/BF01386077zbMath0121.34103OpenAlexW2063593472MaRDI QIDQ2626629

Charles L. Lawson

Publication date: 1964

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

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

zbMATH Keywords

numerical analysis

Related Items (18)

Piecewise linear L₁approximation of planar curves† ⋮ Piece wise linear least–squares approximation of planar curves ⋮ Optimal segmented polynomial \(L_s\)-approximations ⋮ Bivariate segment approximation and splines ⋮ Some results in segmented approximation ⋮ Increasing the efficiency of Chebyshev segment fractional rational approximation ⋮ Piecewise polynomial approximation on optimal meshes ⋮ Optimization ⋮ Optimal segmented approximations ⋮ Computational methods for best spline function approximation ⋮ On a certain duality for segmented minmax problems ⋮ Nonlinear Chebyshev approximation by H-polynomials ⋮ Piecewise linear Chebyshev approximation of planar curves ⋮ Uniform piecewise polynomial approximation with variable joints ⋮ Approximation in normed linear spaces ⋮ Algorithms for Piecewise Polynomials and Splines with Free Knots ⋮ An algorithm for segment approximation ⋮ Functional approximation of planar curves via adaptive segmentation

Cites Work

• Unnamed Item
• Tschebyscheff-Approximationen in kleinen Intervallen. I; II: Stetigkeitssätze für gebrochen rationale Approximationen
• On the computation of rational approximations to continuous functions
• A Survey of Methods for Rational Approximation, with Particular Reference to a New Method Based on a Forumla of Darboux

This page was built for publication: Characteristic properties of the segmented rational minmax approximation problem