Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Real root isolation for exp-log functions
Strzebonski A.  Symbolic and algebraic computation (Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, Linz/Hagenberg, Austria, Jul 20-23, 2008)303-314.2008.Type:Proceedings
Date Reviewed: Sep 11 2008

Exp-log functions f are, roughly speaking, built up from polynomials by algebraic operations, exponentiation, and taking logarithms; therefore, they include reciprocals and radicals. This paper is concerned with roots: points x where f(x)=0, but f(y) ≠ 0 for all y “near” x. The author notes that f(x)=x-√x2=x-exp(½ log x2) has no roots in this sense, even though it is zero for all x > 0. This function is undefined at x=0, since log x2 is undefined, and the author notes that its continuous extension to the whole of the real line is not exp-log, since it is not differentiable at zero. In fact, even f(x) exp(-1/x2), which is apparently defined everywhere, infinitely differentiable, and has no roots for the same reason, is not exp-log, since it is not analytic at zero.

The method relies on the author’s idea of semi-Fourier series, an adaptation of the semi-Budan series [1], and a vast generalization of Sturm sequences used for isolating roots of polynomials. The algorithm relies on being able to test for zero, which is only known to be possible if we assume Schanuel’s conjecture [2], though the author in fact uses a weaker heuristic method that he has never seen fail.

The process seems practicable: sub-second times for all examples from the literature, and only 5.5 seconds for an example with two roots within 10-377 of each other. This is a significant theoretical and practical development, and deservedly won the best paper award at the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2008.

Reviewer:  J. H. Davenport Review #: CR136052 (0911-1077)
1) Richardson, D. Solution of the identity problem for integral exponential functions. Zeitschr. Math. Logik Grundlagen Math. 15, (1969), 333–340.
2) Richardson, D. How to recognize zero. J. Symbolic Comp. 24, (1997), 627–645.
Bookmark and Share
  Reviewer Selected
Editor Recommended
Featured Reviewer
 
 
Algebraic Algorithms (I.1.2 ... )
 
 
Algorithm Design And Analysis (G.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Algebraic Algorithms": Date
Multilinear Cayley factorization
White N. Journal of Symbolic Computation 11(5-6): 421-438, 1991. Type: Article
May 1 1993
On the synthetic factorization of projectively invariant polynomials
Sturmfels B. (ed), Whiteley W. Journal of Symbolic Computation 11(5-6): 439-453, 1991. Type: Article
Dec 1 1992
Invariant and geometric aspects of algebraic complexity theory I
Morgenstern J. Journal of Symbolic Computation 11(5-6): 455-469, 1991. Type: Article
Jun 1 1993
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy