Chebyshev approximation by H-polynomials: A numerical method

DOI10.1016/0021-9045(76)90114-3zbMATH Open0336.65006OpenAlexW2107593985MaRDI QIDQ1230342FDOQ1230342

Authors: K. Appert 

Publication date: 1976

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

Full work available at URL: https://research.utwente.nl/en/publications/chebyshev-approximation-by-hpolynomials-a-numerical-method(f10e3d9c-b5f9-4993-a02a-ce6d97e239ec).html

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Best approximation, Chebyshev systems (41A50)

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Title not available (Why is that?)
• The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
• Nonlinear Programming: A Numerical Survey
• Approximation with Convex Constraints
• Nonlinear Chebyshev approximation by H-polynomials
• Extensions of SUMT for Nonlinear Programming: Equality Constraints and Extrapolation
• Title not available (Why is that?)

This page was built for publication: Chebyshev approximation by H-polynomials: A numerical method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1230342)