Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method
From MaRDI portal
Publication:6173465
DOI10.1134/s0032946022030085OpenAlexW4312959910MaRDI QIDQ6173465
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
computational complexityNewton's methodfast algorithmsrational functionlogarithmic functioninverse functionsFEE methodKaratsuba's methodelementary algebraic functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast multiplication of large numbers
- Faster Integer Multiplication
- Fast Multiple-Precision Evaluation of Elementary Functions
- Computation of π Using Arithmetic-Geometric Mean
- On computation of the Bessel function by summing up the series
- Algorithms Involving Arithmetic and Geometric Means
This page was built for publication: Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method