Return to search

Comparison of the Remez algorithm written in the FORTRAN and the PL/I languages

The idea of obtaining a best approximation in some sense of a function gained considerable importance with the introduction of electronic computers. The Remez algorithm, which is known as the exchange method, is used in this paper to find the best approximating polynomial of a given degree for a real continuous function f(x) on a real finite interval (a,b). The comparison of such an algorithm written in the FORTRAN and the PL/I languages is the main purpose of this paper. A review of the approximation theory is made as well as a discussion of the steps in the programming process. The outstanding features used in the programs of the languages are pointed out and illustrated with examples taken from the programs. The accuracy of the results, the speed, and the storage requirements are analyzed. Also ideas of program organization are discussed.Ball State UniversityMuncie, IN 47306

Identiferoai:union.ndltd.org:BSU/oai:cardinalscholar.bsu.edu:handle/181435
Date03 June 2011
CreatorsRodriguez L., Oscar
ContributorsFuelling, Clinton P.
Source SetsBall State University
Detected LanguageEnglish
Formatvi, 100 leaves : ill. ; 28 cm.
SourceVirtual Press

Page generated in 0.0014 seconds