Russell Bradford
James H. Davenport
ABSTRACT
We present an algorithm for simplifying a large class of elementary functions in the presence of branch cuts. This algorithm works by:(a) verifying that the proposed simplification is correct as a simplification of multi-valued functions;(b) decomposing C (or Cn in the case of multivariate simplifications) according to the branch cuts of the relevant functions;(c) checking that the proposed identity is valid on each component of that decomposition.This process can be interfaced to an assume facility, and, if required, can verify that simplifications are valid "almost everywhere".
- Abramowitz,M. & Stegun,I., Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. US Government Printing Office, 1964. 10th Printing December 1972.]] Google Scholar
Digital Library
- Arnon,D. S., A Cluster-Based Cylindrical Algebraic Decomposition Algorithm. J. Symbolic Comp.5 (1988) pp. 189-211. Also Algorithms in Real Algebraic Geometry (ed. D. S. Arnon & B. Buchberger), Academic Press, London, 1988.]] Google ScholarDigital Library
- Arnon,D. S. & McCallum,S., Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane. SIAM J. Comp.13 (1984) pp. 878-889.]] Google ScholarDigital Library
- Borodin,A., Fagin,R., Hopcroft,J. E. & Tompa,M., Decreasing the Nesting Depth of an Expression Involving Square Roots. J. Symbolic Comp.1 (1985) pp. 169-188.]] Google ScholarDigital Library
- Bradford,R. J., Corless,R. M., Davenport,J. H., Jeffrey,D. J., & Watt,S. M., Reasoning about the Elementary Functions of Complex Analysis. To appear in Annals of Mathematics and Artificial Intelligence.]] Google ScholarDigital Library
- Collins,G. E., Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. Proc. 2nd. GI Conference Automata Theory & Formal Languages (Springer Lecture Notes in Computer Science 33), Springer-Verlag, 1975, pp. 134-183. MR 55 (1978) #771.]] Google ScholarDigital Library
- Corless,R. M., Davenport,J. H., Jeffrey,D. J., Litt,G. & Watt,S. M., Reasoning about, the Elementary Functions of Complex Analysis. Artificial Intelligence and Symbolic Computation (ed. John A. Campbell & Eugenio Roanes-Lozano), Springer Lecture Notes in Artificial Intelligence Vol. 1930, Springer-Verlag 2001, pp. 115-126. http://www.apmaths.uwo.ca/~djeffrey/offprints.html. http://link.springer.de/link/service/series/0558/bibs/1930/19300115.htm]] Google ScholarDigital Library
- Corless,R. M., Davenport,J. H., Jeffrey, D. J. & Watt,S. M., "According to Abramowitz and Stegun". SIGSAM Bulletin34 (2000) 2, pp. 58-65.]] Google ScholarDigital Library
- Corless,R. M. & Jeffrey,D. J., The Unwinding Number. SIGSAM Bulletin30 (1996) 2, issue 116, pp. 28-35.]] Google ScholarDigital Library
- Davenport,J. H. & Heintz,J., Real Quantifier Elimination is Doubly Exponential. J. Symbolic Comp.5 (1988) pp. 29-35. Also Algorithms in Real Algebraic Geometry (ed. D. S. Arnon and B. Buchberger), Academic Press, London, 1988. Zbl. 663.03015. MR 89g:03009.]] Google ScholarDigital Library
- Gabrielov,A. & Vorobjov,N., Complexity of cylindrical decompositions of sub-Pfaffian sets. J. Pure Appl. Algebra164 (2001) pp. 179-197.]]Google Scholar
- Ménissier-Morain, V., Arithmétique exacte, conception, algorithmique et performances d'une implémentation informatique en précision arbitraire. Thèse, Université Paris 7, Dec. 1994.]]Google Scholar
- Richardson,D., Some Unsolvable Problems Involving Elementary Functions of a Real Variable. Journal of Symbolic Logic33(1968), pp. 514-520.]]Google Scholar
- Risch,R. H., Algebraic Properties of the Elementary Functions of Analysis. Amer. J. Math.101 (1979) pp. 743-759. MR 81b:12029.]]Google Scholar
- Weibel,T. & Gonnet,G. H., An Assume Facility for CAS with a Sample Implementation for Maple. Proc. DISCO '92 (Springer Lecture Notes in Computer Science 721, ed. J. P. Fitch), Springer-Verlag, 1993, pp. 95-103.]] Google ScholarDigital Library
Index Terms
- Towards better simplification of elementary functions
Recommendations
Better simplification of elementary functions through power series
ISSAC '03: Proceedings of the 2003 international symposium on Symbolic and algebraic computationIn [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 ...
Quadrilateral mesh simplification
We introduce a simplification algorithm for meshes composed of quadrilateral elements. It is reminiscent of edge-collapse based methods for triangle meshes, but takes a novel approach to the challenging problem of maintaining the quadrilateral ...
A Topological Approach to Simplification of Three-Dimensional Scalar Functions
This paper describes an efficient combinatorial method for simplification of topological features in a 3D scalar function. The Morse-Smale complex, which provides a succinct representation of a function's associated gradient flow field, is used to ...
Comments