Pages that link to "Item:Q4088201"

The following pages link to Fast Multiple-Precision Evaluation of Elementary Functions (Q4088201):

Displaying 50 items.

• Even faster integer multiplication (Q306687) (← links)
• New complexity bounds for image matching under rotation and scaling (Q533416) (← links)
• Effiziente Berechnung spezieller Funktionen mittels asymptotischer Entwicklungen und Eliminationsprozeduren. (An efficient calculation of special functions by asymptotic expansions and elimination procedures) (Q582517) (← links)
• Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
• Hypergeometric analogues of the arithmetic-geometric mean iteration (Q690361) (← links)
• Complete \(p\)-elliptic integrals and a computation formula of \(\pi_p\) for \(p=4\) (Q721833) (← links)
• Analogues of the Brent-Salamin algorithm for evaluating \(\pi\) (Q746388) (← links)
• Recurrence relations for rational cubic methods. II: The Chebyshev method (Q751193) (← links)
• A very rapidly convergent product expansion for pi (Q787637) (← links)
• Weighted power mean discrete dynamical systems: fast convergence properties (Q871412) (← links)
• Recursive computation of derivatives of elliptic functions and of incomplete elliptic integrals (Q905259) (← links)
• Best \(k\)-digit rational approximation of irrational numbers: pre-computer versus computer era (Q928099) (← links)
• On computational efficiency for multi-precision zero-finding methods (Q945380) (← links)
• Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation (Q991138) (← links)
• Complete numerical isolation of real roots in zero-dimensional triangular systems (Q1025386) (← links)
• Multiplication is the easiest nontrivial arithmetic function (Q1066671) (← links)
• The bit-cost of some algorithms for the solution of linear systems (Q1108740) (← links)
• Computing elliptic integrals by duplication (Q1142007) (← links)
• Testing approximate symmetry in the plane is NP-hard (Q1176235) (← links)
• On the complexity of online computations of real functions (Q1186506) (← links)
• Bibliography on the evaluation of numerical software (Q1254823) (← links)
• A refined model of computation for continuous problems (Q1265141) (← links)
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
• Fast evaluation of holonomic functions (Q1274814) (← links)
• Feasible real random access machines (Q1279912) (← links)
• Online computations of differentiable functions (Q1292412) (← links)
• Why does information-based complexity use the real number model? (Q1292417) (← links)
• The quest for pi (Q1361163) (← links)
• Asymptotic bit cost of quadrature formulas obtained by variable transformation (Q1372253) (← links)
• Computational strategies for the Riemann zeta function (Q1587405) (← links)
• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441) (← links)
• Distant decimals of \(\pi \): formal proofs of some algorithms computing them and guarantees of exact computation (Q1663216) (← links)
• Computing Chebyshev knot diagrams (Q1680160) (← links)
• Birth, growth and computation of pi to ten trillion digits (Q1693543) (← links)
• Primality testing with Gaussian periods (Q1737980) (← links)
• Arbitrary precision real arithmetic: design and algorithms (Q1779562) (← links)
• Reduced complexity evaluation of hypergeometric functions (Q1819306) (← links)
• The complexity of number-theoretic constants (Q1861411) (← links)
• Multiprecision arithmetic using fast Hartley transforms (Q1914650) (← links)
• Randomized search trees (Q1923861) (← links)
• Type 2 computational complexity of functions on Cantor's space (Q2277260) (← links)
• Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
• Strong NP-hardness of AC power flows feasibility (Q2294366) (← links)
• On a function involving generalized complete \((p, q)\)-elliptic integrals (Q2302704) (← links)
• Linear differential equations as a data structure (Q2329042) (← links)
• Efficient big integer multiplication and squaring algorithms for cryptographic applications (Q2336123) (← links)
• Learning Poisson binomial distributions (Q2345953) (← links)
• Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era (Q2390176) (← links)
• Real-time computability of real numbers by chemical reaction networks (Q2400944) (← links)
• Efficient accelero-summation of holonomic functions (Q2457428) (← links)