1973/01/01 by J.C. Majithia, D. Levan · 1 citation
Computer Science · Mathematics · #Numerical Methods and Algorithms #Polynomial and algebraic computation #Matrix Theory and Algorithms #Computation #Logarithm #Minicomputer #Subroutine #Base (topology) #Computer science #Algorithm #Mathematics #Computational science #Mathematical analysis
paper · doi:10.1109/proc.1973.9318
openalex publication_date 1973/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
The well-known methods of iteration used suitably can yield a more accurate and rapidly convergent computation for the values of many functions. One typical example is the base-2 logarithm-antilogarithm computation. Some recently proposed techniques are reviewed and compared with an iterative process for computation using a fixed number of iterations. It is shown that the latter yields improved accuracy and can be implemented either as a subroutine or as a hardwired peripheral device for, say, a minicomputer.