A poly-algorithmic approach to simplifying elementary functions

Authors:
James C. Beaumont;Russell J. Bradford;James H. Davenport;Nalina Phisanbut
Affiliations:
University of Bath, Bath, England;University of Bath, Bath, England;University of Bath, Bath, England;University of Bath, Bath, England
Venue:
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Year:
2004

Citing 14
Cited 5

Real quantifier elimination is doubly exponential

Journal of Symbolic Computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination

Journal of Symbolic Computation
Counting connected components of a semialgebraic set in subexponential time

Computational Complexity
Branch cuts in computer algebra

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
A representation of branch-cut information

ACM SIGSAM Bulletin
The unwinding number

ACM SIGSAM Bulletin
How to recognize zero

Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
“According to Abramowitz and Stegun” or arccoth needn't be uncouth

ACM SIGSAM Bulletin - Special issue of OpenMath
Simple CAD construction and its applications

Journal of Symbolic Computation
Reasoning about the Elementary Functions of Complex Analysis

Annals of Mathematics and Artificial Intelligence
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Towards better simplification of elementary functions

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
A new zero-test for formal power series

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Better simplification of elementary functions through power series

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation

Adherence is better than adjacency: computing the Riemann index using CAD

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
On using bi-equational constraints in CAD construction

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Geometry of branch cuts

ACM Communications in Computer Algebra
Understanding branch cuts of expressions

CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Automated simplification of large symbolic expressions

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simplification has been long recognised to be a fundamental problem within computer algebra [17]. However, even for the class of elementary functions, it has not been resolved in a satisfactory way.Algorithms were presented in [4, 2] to solve this problem, and it was seen that both methods had their own strengths and weaknesses. Also, not all functions could be handled by either of the methods alone. The current paper continues this line of development by combining the two methods, and reporting on progress made with the various sub-algorithms involved.