Evaluation of functions on microcomputers: rational approximation of kth roots

Abstract

AbstractThis paper describes the implementation of rational approximation algorithms for evaluation of kth roots in short wordlength machines. The emphasis is on maintaining full machine precision in computers that use fixed point, truncated binary arithmetic with at most 16 bits of wordlength. Included is a table of coefficients for evaluation of kth roots on a 16 bit machine with 3 ≤ k ≤ 11