|
Large Systems
Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method
E. A. Karatsuba Dorodnitsyn Computing Center of the Federal Research Center
“Computer Science and Control” of the Russian Academy of Sciences, Moscow, Russia
Abstract:
We construct new fast evaluation algorithms for elementary algebraic and inverse
functions based on application of two methods: A.A. Karatsuba’s method of 1960 and the
author’s FEE method of 1990. The computational complexity is close to the optimal. The
algorithms admit partial parallelization.
Keywords:
fast algorithms, computational complexity, A.A. Karatsuba’s method, FEE method,
Newton’s method, elementary algebraic functions, inverse functions, rational function, logarithmic function.
Received: 13.06.2022 Revised: 27.07.2022 Accepted: 27.07.2022
Citation:
E. A. Karatsuba, “Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method”, Probl. Peredachi Inf., 58:3 (2022), 90–103; Problems Inform. Transmission, 58:3 (2022), 284–296
Linking options:
https://www.mathnet.ru/eng/ppi2378 https://www.mathnet.ru/eng/ppi/v58/i3/p90
|
Statistics & downloads: |
Abstract page: | 124 | Full-text PDF : | 3 | References: | 21 | First page: | 27 |
|