A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
HAKMEM
Acceleration of Series
The state of the Art of Computer Programming
The state of the Art of Computer Programming
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Variable precision exponential function
ACM Transactions on Mathematical Software (TOMS)
Algorithm 693: a FORTRAN package for floating-point multiple-precision arithmetic
ACM Transactions on Mathematical Software (TOMS)
Fast evaluation of elementary mathematical functions with correctly rounded last bit
ACM Transactions on Mathematical Software (TOMS)
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Algorithm 719: Multiprecision translation and execution of FORTRAN programs
ACM Transactions on Mathematical Software (TOMS)
Approximate Euclidean shortest path in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A set of Ada packages for high-precision calculations
ACM Transactions on Mathematical Software (TOMS)
Comparing the combinational complexities of arithmetic functions
Journal of the ACM (JACM)
On the complexity of diophantine geometry in low dimensions (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Toward Correctly Rounded Transcendentals
IEEE Transactions on Computers
A Fortran Multiple-Precision Arithmetic Package
ACM Transactions on Mathematical Software (TOMS)
A Continued-Fraction Analysis Of Trigonometric Argument Reduction
IEEE Transactions on Computers
A Survey of Exact Arithmetic Implementations
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
The iRRAM: Exact Arithmetic in C++
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
FLATS, a machine for numerical, symbolic and associative computing
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
The MACSYMA “big-floating-point” arithmetic system
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Comparison of arithmetic functions with respect to boolean circuit depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
How to generate random integers with known factorization
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Automating custom-precision function evaluation for embedded processors
Proceedings of the 2005 international conference on Compilers, architectures and synthesis for embedded systems
Space-efficient evaluation of hypergeometric series
ACM SIGSAM Bulletin
Space-efficient evaluation of hypergeometric series
ACM SIGSAM Bulletin
Efficient accelero-summation of holonomic functions
Journal of Symbolic Computation
Time-and space-efficient evaluation of some hypergeometric constants
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complete numerical isolation of real zeros in zero-dimensional triangular systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complexity of Operators on Compact Sets
Electronic Notes in Theoretical Computer Science (ENTCS)
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Complete numerical isolation of real roots in zero-dimensional triangular systems
Journal of Symbolic Computation
New Complexity Bounds for Image Matching under Rotation and Scaling
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
Flats, a machine for numerical, symbolic and associative computing
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Computing correctly rounded integer powers in floating-point arithmetic
ACM Transactions on Mathematical Software (TOMS)
Fast computations of the exponential function
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The design of core 2: a library for exact numeric computation in geometry and algebra
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
New complexity bounds for image matching under rotation and scaling
Journal of Discrete Algorithms
Optimizing n-variate (n+k)-nomials for small k
Theoretical Computer Science
Mesa: automatic generation of lookup table optimizations
Proceedings of the 4th International Workshop on Multicore Software Engineering
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the randomness of bits generated by sufficiently smooth functions
ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Computation of high-precision mathematical constants in a combined cluster and grid environment
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Learning poisson binomial distributions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Best k-digit rational bounds for irrational numbers: Pre- and super-computer era
Mathematical and Computer Modelling: An International Journal
On the Sum of Square Roots of Polynomials and Related Problems
ACM Transactions on Computation Theory (TOCT)
On the detection of tracks in spectrogram images
Pattern Recognition
Continuous-time stochastic games with time-bounded reachability
Information and Computation
| Hi-index | 0.01 |
Let ƒ(x) be one of the usual elementary functions (exp, log, artan, sin, cosh, etc.), and let M(n) be the number of single-precision operations required to multiply n-bit integers. It is shown that ƒ(x) can be evaluated, with relative error &Ogr;(2-n), in &Ogr;(M(n)log (n)) operations as n → ∞, for any floating-point number x (with an n-bit fraction) in a suitable finite interval. From the Schönhage-Strassen bound on M(n), it follows that an n-bit approximation to ƒ(x) may be evaluated in &Ogr;(n log2(n) log log(n)) operations. Special cases include the evaluation of constants such as &pgr;, e, and e&pgr;. The algorithms depend on the theory of elliptic integrals, using the arithmetic-geometric mean iteration and ascending Landen transformations.