Adherence is better than adjacency: Computing the riemann index using CAD

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2005, Issue , 2005, Pages 37-44

  Beaumont, James C ^a   Bradford, Russell J ^a   Davenport, James H ^a   Phisanbut, Nalina ^a  

^a University of Bath   (United Kingdom)

Author keywords

Branch Cuts; Elementary Functions; Riemann Surfaces

Indexed keywords

BRANCH CUTS; CYLINDRICAL ALGEBRAIC DECOMPOSITION (CAD); ELEMENTARY FUNCTIONS; RIEMANN SURFACES;

ALGEBRA; COMPUTATIONAL METHODS; FUNCTION EVALUATION; PROBLEM SOLVING;

COMPUTATION THEORY;

EID: 33749542237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. ABRAMOWITZ, M. & STEGUN, I., Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. J. Wiley & sons inc., May 1984.
2. ARNON, D. S., A cluster-based CAD Algorithm. In J. Symbolic Computation, 5(1/2) 189-212, 1988.
3. BEAUMONT, J., BRADFORD, R. & DAVENPORT, J. Better Simplification of Elementary Functions Through Power Series. In ISSAC 2003(2003), J.R. Sendra, Ed., ACM, New York, 30-36.
4. BEAUMONT, J., BRADFORD, R., DAVENPORT, J. & PHISANBUT, N. A Poly-Algorithmic Approach to Simplifying Elementary Functions. In ISSAC 2004 (2004). J. Gutierrez, Ed., ACM, New York, 27-34.
5. BEAUMONT, J. C., BRADFORD, R. & PHISANBUT, N. Practical Simplification of Elementary Functions using CAD. In Algorithmic Algebra and Logic 2005.
6. _. Effective Simplification of Elementary Functions in preparation.
7. BRADFORD, R., CORLESS, R., DAVENPORT, J., JEFFREY, D. & WATT, S. Reasoning about the Elementary Functions of Complex Analysis. Ann. Math. & Artificial Intelligence 36, (2002), 303-318.
8. BRADFORD, R. & DAVENPORT, J. Towards Better Simplification of Elementary Functions. In Proc. ISSAC (2002), T. Mora, Ed., ACM, New York, 15-22.
9. CARETTE, J. Understanding Expression Simplification. In ISSAC 2004 (2004), Jaime Gutierrez, Ed., ACM, New York, 72-79.
10. COLLINS, G. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. Proc. 2nd. GI Conf. Automata Theory & Formal Languages (1975), vol. 33 of SLNCS.
11. COLLINS, G.& MCCALLUM, S. Local box adjacency algorithms for Cylindrical Algebraic Decomposition. In J. Symbolic Computation, 33(3):321-342, 2002.
12. CORLESS, R., DAVENPORT, J., JEFFREY, D. & WATT, S. According to Abramowitz and Stegun. SIGSAM Bulletin 34, 2 (2000), 58-65.
13. CORLESS, R. M. & JEFFREY, D. J. The Unwinding Number. SIGSAM Bull. 30 (1996) 2, issue 116, 28-35.
14. CORLESS, R,., GONNET, G., JEFFREY, D., HARE, D. & KNUTH, D. On the Lambert W Function. In Adv. in Computational Mathematics 5, (1996), 329-359.
15. n is Important for the Algebra of Elementary Functions., in Algebra, Geometry, and Software Systems 207-224,(2003).
16. DAVENPORT, J. H., MKM from Book to Computer: A Case Study In MKM 2003 17-29, A. Asperti, B. Buchberger, J. H. Davenport, Ed., Springer.
17. DAVENPORT, J. AND HEINTZ, J. Real Quantifier Elimination is Doubly Exponential. J. Symbolic Computation 5, (1988), 29-35.
18. DOLZMANN. A, SEIDL. A & STURM. T. Efficient Projection Orders for CAD. In Proc. ISSAC (2004), Jaime Gutierrez, Ed., ACM, New York, 111-118.
19. FATEMAN, R. J. & DINGLE, A. Branch Cuts in Computer Algebra. In ISSAC 1994, ACM Press, New York, 1994, 250-257.
20. GRIGORIEV, D. Yu. & VOROBJOV, N. N.JR. Counting connected components of a semi-algebraic set in subexponential time. Computational Complexity 2 (1992) 133-184.
21. GABRIELOV, A. & VOROBJOV, N. Complexity of cylindrical decompositions of sub-Pfaffian sets. J. Pure Appl. Algebra 164 (2001), 179-197.
22. JEFFREY, D. J. & NORMAN, A. C. Not seeing the roots for the branches: multivalued functions in computer algebra. SIGSAM Bulletin vol 38 (2004) no. 3, issue 149, 57-66.
23. MOSES, J. Algebraic Simplification, a Guide for the Perplexed. In Advances in Computational Mathematics 14, no.8 (1971).
24. H. HONG et al. Quantifier Elimination by Partial Cylindrical Algebraic Decomposition. http://www.cs.usna.edu/~qepcad/B/QEPCAD.html
25. RICHARDSON. D. Some Unsolvable Problems Involving Elementary Functions of a Real Variable. Journal of Symbolic Logic 33(1968), 514-520.
26. RICHARDSON, D. How to Recognize Zero. In Journal of Symbolic Computation (1994), 24(6), 627-646.
27. VAN DER HOEVEN, J. A new Zero-test for Formal Power Series. In ISSAC 2002 (2002), T. Mora, Ed., ACM, New York, 117-122.