Discrete Basis and Computation of Elementary Functions

1 January 1985

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-34 (9) , 857-862
https://doi.org/10.1109/tc.1985.1676643

Abstract

We give necessary and sufficient conditions in order that the infinite product or sum of the terms of a positive decreasing sequence generates the reals in a given interval.

Keywords

This publication has 12 references indexed in Scilit:

VLSI implementation of rotations in pseudo-Euclidean spaces
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
Calculator Function Approximation
The American Mathematical Monthly, 1983
Calculator Algorithms
Mathematics Magazine, 1978
Fourier Transform Computers Using CORDIC Iterations
IEEE Transactions on Computers, 1974
Radix-16 Evaluation of Certain Elementary Functions
IEEE Transactions on Computers, 1973
Automatic Computation of Exponentials, Logarithms, Ratios and Square Roots
IBM Journal of Research and Development, 1972
A unified algorithm for elementary functions
Published by Association for Computing Machinery (ACM) ,1971
A Class of Algorithms for Ln x, Exp x, Sin x, Cos x, Tan^-1 x, and Cot^-1 x
IEEE Transactions on Electronic Computers, 1965
The CORDIC Trigonometric Computing Technique
IRE Transactions on Electronic Computers, 1959
Representations for real numbers and their ergodic properties
Acta Mathematica Hungarica, 1957