Efficient Multiple-Precision Evaluation of Elementary Functions

DOI10.2307/2008657zbMath0657.65032OpenAlexW4254735125MaRDI QIDQ3805743

David M. Smith

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2008657

zbMATH Keywords

exponential functiontrigonometric functionsNewton iterationTaylor expansionelementary functionsLogarithmmultiple-precision

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation of special functions and constants, construction of tables (65D20) Elementary functions (26A09) Exponential and trigonometric functions (33B10)

Related Items (7)

Fast and Rigorous Arbitrary-Precision Computation of Gauss--Legendre Quadrature Nodes and Weights ⋮ Multiple/arbitrary precision interval computations in C-XSC ⋮ Recursive computation of derivatives of elliptic functions and of incomplete elliptic integrals ⋮ The Borwein Brothers, Pi and the AGM ⋮ The functions erf and erfc computed with arbitrary precision and explicit error bounds ⋮ Computing Hypergeometric Functions Rigorously ⋮ Short addition sequences for theta functions

Uses Software

• Algorithm 524

Cites Work

• Unnamed Item
• Fast Multiple-Precision Evaluation of Elementary Functions
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials

This page was built for publication: Efficient Multiple-Precision Evaluation of Elementary Functions