Fast Multiple-Precision Evaluation of Elementary Functions
From MaRDI portal
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)
Cited in
(89)- Birth, growth and computation of pi to ten trillion digits
- Strong NP-hardness of AC power flows feasibility
- The complexity of number-theoretic constants
- Hypergeometric analogues of the arithmetic-geometric mean iteration
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- New complexity bounds for image matching under rotation and scaling
- The complexity of class polynomial computation via floating point approximations
- In Praise of Numerical Computation
- New Complexity Bounds for Image Matching under Rotation and Scaling
- Feasible real random access machines
- Complexity, decidability and completeness
- Fast computation of some special integrals of mathematical physics
- Complexity of operators on compact sets
- Efficient big integer multiplication and squaring algorithms for cryptographic applications
- Bibliography on the evaluation of numerical software
- Online computations of differentiable functions
- The bit-cost of some algorithms for the solution of linear systems
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
- Testing approximate symmetry in the plane is NP-hard
- A refined model of computation for continuous problems
- Randomized search trees
- Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
- Fuchsian holonomic sequences
- Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications
- Computations of class numbers of real quadratic fields
- Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of calculation
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Complete \(p\)-elliptic integrals and a computation formula of \(\pi_p\) for \(p=4\)
- Recurrence relations for rational cubic methods. II: The Chebyshev method
- Effiziente Berechnung spezieller Funktionen mittels asymptotischer Entwicklungen und Eliminationsprozeduren. (An efficient calculation of special functions by asymptotic expansions and elimination procedures)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
- Even faster integer multiplication
- Weighted power mean discrete dynamical systems: fast convergence properties
- Fast evaluation algorithms for elementary algebraic and inverse functions using the FEE method
- Theoretical computer science: computational complexity
- A STUDY ON THE RANDOMNESS OF THE DIGITS OF π
- Fast evaluation of holonomic functions
- Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation
- Fast evaluation of bessel functions
- The quest for pi
- Multiprecision arithmetic using fast Hartley transforms
- Effective genericity and differentiability
- Computing error bounds for asymptotic expansions of regular P-recursive sequences
- Analogues of the Brent-Salamin algorithm for evaluating \(\pi\)
- Computing prime harmonic sums
- Unscented Kalman filter with stable embedding for simple, accurate, and computationally efficient state estimation of systems on manifolds in Euclidean space
- Computational strategies for the Riemann zeta function
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- Detecting perfect powers in essentially linear time
- Primality testing with Gaussian periods
- Feasible real random access machines
- Computing class polynomials for abelian surfaces
- The Elliptic Integral Machine: A Collision-based Model of Computation
- On the Order of Power Series and the Sum of Square Roots Problem
- Recursive computation of derivatives of elliptic functions and of incomplete elliptic integrals
- The computability of LQR and LQG control
- Regularity of Conjugacies between Critical Circle Maps: An Experimental Study
- On the complexity of online computations of real functions
- On computational efficiency for multi-precision zero-finding methods
- Linear differential equations as a data structure
- A pseudo-polynomial time algorithm for solving the knapsack problem in polynomial space
- A Real Number Structure that is Effectively Categorical
- A Rigorous Time Bound for Factoring Integers
- A very rapidly convergent product expansion for pi
- Arbitrary precision real arithmetic: design and algorithms
- Une méthodologie du calcul hardware des fonctions élémentaires
- Fast multivariate multi-point evaluation revisited
- Matrix arithmetic-geometric mean and the computation of the logarithm
- Computing present values by the AGM
- Computability of real functions with oracle pointer machines implies real-time simulation of chemical reaction networks
- Foundations of Exact Rounding
- Reduced complexity evaluation of hypergeometric functions
- Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era
- Efficient Multiple-Precision Evaluation of Elementary Functions
- Multiplication is the easiest nontrivial arithmetic function
- Computing elliptic integrals by duplication
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
- Cyclotomic identity testing and applications
- Efficient accelero-summation of holonomic functions
- On a function involving generalized complete \((p, q)\)-elliptic integrals
- Why does information-based complexity use the real number model?
- Asymptotic bit cost of quadrature formulas obtained by variable transformation
- Type 2 computational complexity of functions on Cantor's space
- The Borwein brothers, pi and the AGM
- FP//LINSPACE evaluation of real Lambert W-function W₀
- Computing Chebyshev knot diagrams
- An 𝐿(1/3) algorithm for ideal class group and regulator computation in certain number fields
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- Order bounds for C2-finite sequences
This page was built for publication: Fast 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 Q4088201)
