Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

ANTS
1998
Springer

favoriteEmaildiscussreport

135views Algorithms» more ANTS 1998»

Fast Multiprecision Evaluation of Series of Rational Numbers

13 years 9 months ago

Fast Multiprecision Evaluation of Series of Rational Numbers

Download www.ginac.de

We describe two techniques for fast multiple-precision evaluation of linearly convergent series, including power series and Ramanujan series. The computation time for N bits is O((log N)2 M(N)), where M(N) is the time needed to multiply two N-bit numbers. Applications include fast algorithms for elementary functions, , hypergeometric functions at rational points, (3), Euler's, Catalan's and Ap

Bruno Haible, Thomas Papanikolaou

Real-time Traffic

Algorithms | ANTS 1998 | Convergent Series | Fast Multiple-precision Evaluation | Ramanujan Series |

claim paper

Related Content

» PRECISE efficient multiprecision evaluation of algebraic roots and predicates for reliable...

» Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales

» A Fast Algorithm for MacMahons Partition Analysis

» A fast and robust hepatocyte quantification algorithm including vein processing

» Recurrence relations and fast algorithms

» Frequency of Symbol Occurrences in Simple Nonprimitive Stochastic Models

» Evaluation of the Cognitive Effects of Travel Technique in Complex Real and Virtual Enviro...

» A band factorization technique for transition matrix element asymptotics

» Fast and qualityguaranteed data streaming in resourceconstrained sensor networks

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ANTS
Authors	Bruno Haible, Thomas Papanikolaou

Comments (0)