Efficient Multiple-Precision Evaluation of Elementary Functions
From MaRDI portal
Recommendations
Cites work
Cited in
(18)- Efficient evaluation of oversampled functions
- Separable asymptotic cost of evaluating elementary functions
- A domain-specific architecture for elementary function evaluation
- The Fermat rule for multifunctions for super efficiency
- Fast calculation and high precision of basic elementary functions based on power series expansions
- The Borwein brothers, pi and the AGM
- scientific article; zbMATH DE number 1186953 (Why is no real title available?)
- Multiple/arbitrary precision interval computations in C-XSC
- Fast evaluation of the elementary functions in single precision
- Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights
- Variable-Precision Exponential Evaluation
- Short addition sequences for theta functions
- scientific article; zbMATH DE number 219930 (Why is no real title available?)
- Computing hypergeometric functions rigorously
- Evaluating elementary functions with guaranteed precision
- The functions erf and erfc computed with arbitrary precision and explicit error bounds
- The polynomial set associated with a fixed number of matrix-matrix multiplications
- Recursive computation of derivatives of elliptic functions and of incomplete elliptic integrals
This page was built for publication: Efficient Multiple-Precision Evaluation of Elementary Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3805743)