Thumbnail
Access Restriction
Subscribed

Author Gargantini, I.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract The second Remes algorithm as originally established for polynomials, may converge or not when the approximating functions are rational. However, the few results known in this domain show how efficient the algorithm can be to obtain approximations with a small error, much more than in the polynomial case, in which the best approximation can be very nearly approached directly by a series development. The aim of this paper is to investigate the limitations of the applicability of certain extensions of the algorithm to the case where the approximations are rational as well as to present some numerical results.
Description Affiliation: IBM Zurich Research Lab., Switzerland (Gargantini, I.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 9
Issue Number 12
Page Count 5
Starting Page 859
Ending Page 863


Open content in new tab

   Open content in new tab
Source: ACM Digital Library