On the optimum approximation of real rational functions via linear programming

摘要

The approximation of real rational functions via linear-programming (LP) techniques usually encounters difficulties that are concerned with long computation times and extensive memory requirements. This paper is introducing a new fast and efficient LP method requiring minimum memory storage. The proposed approach is based on the minimization of a minimax criterion. Analytical examples are presented to illustrate the implementation procedure and advantages of the algorithm.