Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
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. © 1966, ACM. All rights reserved.
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Xiaozhu Kang, Hui Zhang, et al.
ICWS 2008