Skip to main content
Log in

Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method

  • LARGE SYSTEMS
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Karatsuba, A. and Ofman, Yu., Multiplication of Multidigit Numbers on Automata, Dokl. Akad. Nauk SSSR, 1962, vol. 145, no. 2, pp. 293–294 [Soviet Phys. Doklady (Engl. Transl.), 1963, vol. 7, no. 7, pp. 595–596]. http://mi.mathnet.ru/eng/dan26729

    Google Scholar 

  2. Dynkin, E.B., Kolmogorov, A.N., Kostrikin, A.I., Pjateckiĭ-Šapiro, I.I., Šafarevič, I.R., and Sinaĭ, Ja.G., Six Lectures Delivered at the International Congress of Mathematicians in Stockholm, 1962. Providence, RI: Amer. Math. Soc., 1963.

    Book  Google Scholar 

  3. Karatsuba, A.A., The Complexity of Computations, in Optimal'noe upravlenie i differentsial’nye uravneniya (Optimal Control and Differential Equations), Collected Papers, Tr. Mat. Inst. im. V.A. Steklova, 1995, vol. 211, pp. 186–202 [Proc. Steklov Inst. Math. (Engl. Transl.), 1995, vol. 211, pp. 169–183]. http://mi.mathnet.ru/eng/tm1120

    Google Scholar 

  4. Schönhage, A. and Strassen, V., Schnelle Multiplikation groβer Zahlen, Computing, 1971, vol. 7, no. 3–4, pp. 281–292. https://doi.org/10.1007/BF02242355

    Article  MathSciNet  Google Scholar 

  5. Fürer, M., Faster Integer Multiplication, SIAM J. Comput., 2009, vol. 39, no. 3, pp. 979–1005. https://doi.org/10.1137/070711761

    Article  MathSciNet  Google Scholar 

  6. Karatsuba, E.A., Fast Evaluation of Transcendental Functions, Probl. Peredachi Inf., 1991, vol. 27, no. 4, pp. 76–99 [Probl. Inf. Transm. (Engl. Transl.), 1991, vol. 27, no. 4, pp. 339–360]. http://mi.mathnet.ru/eng/ppi584

    MATH  Google Scholar 

  7. Karatsuba, E.A., Fast Calculation of the Riemann Zeta Function \(\zeta(s)\) for Integer Values of the Argument \(s\), Probl. Peredachi Inf., 1995, vol. 31, no. 4, pp. 69–80 [Probl. Inf. Transm. (Engl. Transl.), 1995, vol. 31, no. 4, pp. 353–362]. http://mi.mathnet.ru/eng/ppi294

    MATH  Google Scholar 

  8. Karatsuba, E.A., Fast Computation of Some Special Integrals of Mathematical Physics, Scientific Computing, Validated Numerics, Interval Methods, Krämer, W. and von Gudenberg, J.W., Eds., Boston: Springer, 2001, pp. 29–41. https://doi.org/10.1007/978-1-4757-6484-0_3

  9. Karatsuba, E.A., Calculation of Bessel Functions via the Summation of Series, Sib. Zh. Vychisl. Mat., 2019, vol. 22, no. 4, pp. 453–472 [Numer. Anal. Appl. (Engl. Transl.), 2019, vol. 12, no. 4, pp. 372–387]. https://doi.org/10.1134/S1995423919040050

    Google Scholar 

  10. Salamin, E., Computation of \(\pi\) Using Arithmetic-Geometric Mean, Math. Comp., 1976, vol. 30, no. 135, pp. 565–570. https://doi.org/10.2307/2005327

    MathSciNet  MATH  Google Scholar 

  11. Carlson, B.C., Algorithms Involving Arithmetic and Geometric Means, Amer. Math. Monthly, 1971, vol. 78, no. 5, pp. 496–505. https://doi.org/10.2307/2317754

    Article  MathSciNet  Google Scholar 

  12. Borwein, J.M. and Borwein, P.B., Pi and the AGM: A Study in Analytic Number Theory and Computational Complexity, New York: Wiley, 1987.

    MATH  Google Scholar 

  13. Cook, S.A., On the Minimum Computation Time of Functions, PhD Thesis. Dept. of Mathematics, Harvard Univ., Cambridge, MA, USA, 1966.

    Google Scholar 

  14. Benderskii, Yu.V., Fast Computations, Dokl. Akad. Nauk SSSR, 1975, vol. 223, no. 5, pp. 1041–1043. http://mi.mathnet.ru/eng/dan39204

    MathSciNet  Google Scholar 

  15. Brent, R.P., Fast Multiple-Precision Evaluation of Elementary Functions, J. ACM, 1976, vol. 23, no. 2, pp. 242–251. https://doi.org/10.1145/321941.321944

    MathSciNet  MATH  Google Scholar 

  16. Fikhtengol’ts, G.M., Kurs differentsial’nogo i integral’nogo ischisleniya (A Course in Differential and Integral Calculus), Moscow: Fizmatgiz, 1959, vol. 2.

    Google Scholar 

  17. Yakhontov, S.V., Time- and Space-Efficient Evaluation of the Real Logarithmic Function on Schönhage Machine, Prikl. Diskr. Mat., 2013, no. 2 (20), pp. 101–114. http://mi.mathnet.ru/eng/pdm414

    MATH  Google Scholar 

  18. Lozier, D.W. and Olver, F.W.J., Numerical Evaluation of Special Functions, Mathematics of Computation 1943–1993: A Half-Century of Computational Mathematics (Proc. 48th Symp. in Applied Mathematics, Aug. 9–13, 1993, Vancouver, BC, Canada), Gautschi, W., Ed., Providence, RI: Amer. Math. Soc., 1995, pp. 79–125. https://doi.org/10.1090/psapm/048/1314844

Download references

Author information

Authors and Affiliations

Authors

Additional information

Translated from Problemy Peredachi Informatsii, 2022, Vol. 58, No. 3, pp. 90–103. https://doi.org/10.31857/S0555292322030081

In memoriam Yuri Ivanovich Zhuravlev (Jan. 14, 1935 – Jan. 14, 2022)

“Don’t be upset! A method that is not stolen is a bad method, because no one needs it!” (Yu.I. Zhuravlev, 2000)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Karatsuba, E. Fast Evaluation Algorithms for Elementary Algebraic and Inverse Functions Using the FEE Method. Probl Inf Transm 58, 284–296 (2022). https://doi.org/10.1134/S0032946022030085

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946022030085

Keywords

Navigation