F. Grenez
Abstract
Constrained Chebychev approximation is a known mathematical problem, and Remes' type algorithms for finding the solution have been described. It is shown in this paper that the classical Parks-McClellan program can be converted into a general program for constrained approximation.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Constrained Chebychev approximation is a known mathematical problem, and Remes' type algorithms for finding the solution have been described. It is shown in this paper that the classical Parks-McClellan program can be converted into a general program for constrained approximation.
Key concepts: Chebyshev filter, Approximation theory, Finite impulse response, Approximation algorithm, Equioscillation theorem, Minimax approximation algorithm, Mathematical optimization, Applied mathematics