John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
It is shown that if one uses a carefully defined concept of stability (Stewart, G.W., Introduction to matrix computations, Academic Press, New York and London, 1973) then Horner's rule for the evaluation of a polynomial and some other evaluation methods are not always stable. A method is presented which is always stable. The operations count for this method is the same as that for Horner's rule. The method is generalized to apply to all rational functions of one variable. © 1983 Springer-Verlag.
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996