Better simplification of elementary functions through power series
James C. Beaumont, Russell Bradford, James H. Davenport · 2003
In [5], we introduced an algorithm for deciding whether a proposed simplification of elementary functions was correct in the presence of branch cuts. This algorithm used multivalued function simplification followed by verification that the branches were consistent.In [14] an algorithm was presented for zero-testing functions defined by ordinary differential equations, in terms of their power series.The purpose of the current paper is to investigate merging the two techniques. In particular, we will show an explicit reduction to the constant problem [16].