Premium
An algorithm for discrete Chebyshev linear approximation with linear constraints
Author(s) -
Roberts F. D. K.,
Barrodale I.
Publication year - 1980
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620150602
Subject(s) - chebyshev iteration , chebyshev filter , chebyshev equation , chebyshev nodes , chebyshev polynomials , mathematics , equioscillation theorem , algorithm , linear programming , extension (predicate logic) , linear approximation , approximation theory , mathematical optimization , computer science , orthogonal polynomials , nonlinear system , mathematical analysis , classical orthogonal polynomials , gegenbauer polynomials , physics , quantum mechanics , programming language
We describe a dual linear programming algorithm for solving the discrete Chebyshev (or l ∞ ) approximation problem subject to any type of linear constraints. The numerical results provided here indicate that the present algorithm is an efficient extension of the Barrodale and Phillips Chebyshev algorithm, to which it reduces in the absence of constraints.