Fast evaluation of the elementary functions in double precision

Author

Wong, W.F. ; Goto, E.

Author_Institution

Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore

Volume

1

fYear

1994

fDate

4-7 Jan. 1994

Firstpage

349

Lastpage

358

Abstract

One of the most spectacular development in computer technology is the growth in memory density and speed. It is with this development in mind that we intend to tackle the old problem of computing the elementary functions. Since the dawn of computing, the fast and accurate computation of the elementary functions has been a constant concern of numerical computing. It now seems possible to use tables of sizes in the range of megabits to aid in such computation. To this end, in this paper, we propose a method called ATA-M (Add-Table Lookup-Add with Multiplication) for evaluating polynomials with the aid of tables. When applied to the elementary functions, we obtained a set of algorithms which computes the reciprocal, square root, exponential, sine, cosine, logarithm, are tangent and the hyperbolic functions in about 3 to 4 double precision floating point multiplication time and utilizing about 2 Mbyte of tables.<>

Keywords

digital arithmetic; polynomials; table lookup; ATA-M; Add-Table Lookup-Add with Multiplication; double precision; elementary functions; floating point multiplication time; hyperbolic functions; memory density; memory speed; numerical computing; polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1994. Proceedings of the Twenty-Seventh Hawaii International Conference on

Conference_Location

Wailea, HI, USA

Print_ISBN

0-8186-5090-7

Type

conf

DOI

10.1109/HICSS.1994.323158

Filename

323158