Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method

DOI10.1134/S0032946022030085MaRDI QIDQ6173465zbMATH OpenOpenAlexFDO

Authors E. A. Karatsuba

Publication date 21 July 2023

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946022030085

zbMATH Keywords

computational complexityelementary algebraic functionsfast algorithmsFEE methodinverse functionsKaratsuba's methodlogarithmic functionNewton's methodrational function

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1361301
• On a new method for fast evaluation of transcendental functions
• scientific article; zbMATH DE number 3953481
• scientific article; zbMATH DE number 1186953
• Fast algorithms for elementary operations on complex power series

Cites work

• Algorithms Involving Arithmetic and Geometric Means
• Computation of π Using Arithmetic-Geometric Mean
• Fast evaluation of the Riemann zeta-function (s) at integral values of the argument s
• Fast Multiple-Precision Evaluation of Elementary Functions
• Fast multiplication of large numbers
• Faster integer multiplication
• scientific article; zbMATH DE number 4216820 (Why is no real title available?)
• scientific article; zbMATH DE number 3987351 (Why is no real title available?)
• scientific article; zbMATH DE number 733520 (Why is no real title available?)
• scientific article; zbMATH DE number 7310208 (Why is no real title available?)
• On computation of the Bessel function by summing up the series

This page was built for publication: Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173465)