Fast Multiple-Precision Evaluation of Elementary Functions
From MaRDI portal
Publication:4088201
DOI10.1145/321941.321944zbMath0324.65018OpenAlexW2166717942WikidataQ55887322 ScholiaQ55887322MaRDI QIDQ4088201
Publication date: 1976
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321941.321944
Numerical smoothing, curve fitting (65D10) Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Rate of convergence, degree of approximation (41A25) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to approximations and expansions (41-04)
Related Items
Even faster integer multiplication ⋮ The quest for pi ⋮ Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era ⋮ The bit-cost of some algorithms for the solution of linear systems ⋮ Asymptotic bit cost of quadrature formulas obtained by variable transformation ⋮ Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation ⋮ Multiprecision arithmetic using fast Hartley transforms ⋮ Effective genericity and differentiability ⋮ Real-time computability of real numbers by chemical reaction networks ⋮ Weighted power mean discrete dynamical systems: fast convergence properties ⋮ Une méthodologie du calcul hardware des fonctions élémentaires ⋮ Fast evaluation of bessel functions ⋮ Fast Computation of Some Special Integrals of Mathematical Physics ⋮ Randomized search trees ⋮ Computing Chebyshev knot diagrams ⋮ The Elliptic Integral Machine: A Collision-based Model of Computation ⋮ On the Order of Power Series and the Sum of Square Roots Problem ⋮ Order bounds for C2-finite sequences ⋮ Computing elliptic integrals by duplication ⋮ A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space ⋮ Birth, growth and computation of pi to ten trillion digits ⋮ Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method ⋮ Computing error bounds for asymptotic expansions of regular P-recursive sequences ⋮ Unscented Kalman filter with stable embedding for simple, accurate, and computationally efficient state estimation of systems on manifolds in Euclidean space ⋮ The computability of LQR and LQG control ⋮ Recursive computation of derivatives of elliptic functions and of incomplete elliptic integrals ⋮ Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) ⋮ Univariate Real Root Isolation over a Single Logarithmic Extension of Real Algebraic Numbers ⋮ Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era ⋮ Testing approximate symmetry in the plane is NP-hard ⋮ The Borwein Brothers, Pi and the AGM ⋮ Efficient accelero-summation of holonomic functions ⋮ Primality testing with Gaussian periods ⋮ On the complexity of online computations of real functions ⋮ On computational efficiency for multi-precision zero-finding methods ⋮ Hypergeometric analogues of the arithmetic-geometric mean iteration ⋮ A STUDY ON THE RANDOMNESS OF THE DIGITS OF π ⋮ Complexity of Operators on Compact Sets ⋮ Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications ⋮ New complexity bounds for image matching under rotation and scaling ⋮ An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields ⋮ Computing present values by the AGM ⋮ Detecting perfect powers in essentially linear time ⋮ Computations of class numbers of real quadratic fields ⋮ Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time ⋮ Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy ⋮ Arbitrary precision real arithmetic: design and algorithms ⋮ The complexity of class polynomial computation via floating point approximations ⋮ Computing prime harmonic sums ⋮ A Rigorous Time Bound for Factoring Integers ⋮ Type 2 computational complexity of functions on Cantor's space ⋮ Effiziente Berechnung spezieller Funktionen mittels asymptotischer Entwicklungen und Eliminationsprozeduren. (An efficient calculation of special functions by asymptotic expansions and elimination procedures) ⋮ Complete \(p\)-elliptic integrals and a computation formula of \(\pi_p\) for \(p=4\) ⋮ Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation ⋮ Foundations of Exact Rounding ⋮ Fast multivariate multi-point evaluation revisited ⋮ Bibliography on the evaluation of numerical software ⋮ Strong NP-hardness of AC power flows feasibility ⋮ Matrix Arithmetic-Geometric Mean and the Computation of the Logarithm ⋮ Analogues of the Brent-Salamin algorithm for evaluating \(\pi\) ⋮ On a function involving generalized complete \((p, q)\)-elliptic integrals ⋮ A refined model of computation for continuous problems ⋮ Regularity of Conjugacies between Critical Circle Maps: An Experimental Study ⋮ Recurrence relations for rational cubic methods. II: The Chebyshev method ⋮ New Complexity Bounds for Image Matching under Rotation and Scaling ⋮ Complete numerical isolation of real roots in zero-dimensional triangular systems ⋮ Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)] ⋮ Reduced complexity evaluation of hypergeometric functions ⋮ Complexity, decidability and completeness ⋮ Fast evaluation of holonomic functions ⋮ In Praise of Numerical Computation ⋮ Feasible real random access machines ⋮ Efficient Multiple-Precision Evaluation of Elementary Functions ⋮ Online computations of differentiable functions ⋮ Why does information-based complexity use the real number model? ⋮ Linear differential equations as a data structure ⋮ Unnamed Item ⋮ A very rapidly convergent product expansion for pi ⋮ Computational strategies for the Riemann zeta function ⋮ Efficient big integer multiplication and squaring algorithms for cryptographic applications ⋮ Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval ⋮ Learning Poisson binomial distributions ⋮ The complexity of number-theoretic constants ⋮ Multiplication is the easiest nontrivial arithmetic function ⋮ Computing Class Polynomials for Abelian Surfaces ⋮ A Real Number Structure that is Effectively Categorical
Uses Software
