Remez Algorithm

This package implements Remez algorithm. Remez algorithm seeks the minimax polynomial that approximates a given function in a given interval. The package includes four M-files and one PDF-file. The first M-file is called findzero.m, it computes the root of a given function using the method of chords. The second m file is err.m, it computes the error function for a given function and its approximating polynomial. The third M-file is remez.m, it implements Remez algorithm. The fourth m file is a test script. The PDF-file is a brief description of Remez algorithm.