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