Towards better simplification of elementary functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Towards better simplification of elementary functions

Full text

Pdf (188 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 2002 international symposium on Symbolic and algebraic computation table of contents

Lille, France

Pages: 16 - 22

Year of Publication: 2002

ISBN:1-58113-484-3

Authors

Russell Bradford	University of Bath, Bath, England
James H. Davenport	University of Bath, Bath, England

Sponsor

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 20, Citation Count: 5

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/780506.780509 What is a DOI?

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 Cⁿ 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".

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Milton Abramowitz, Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,, Dover Publications, Incorporated, 1974
	2	Dennis S. Arnon, A cluster-based cylindrical algebraic decomposition algorithm, Journal of Symbolic Computation, v.5 n.1-2, p.189-212, February/April 1988 [doi>10.1016/S0747-7171(88)80012-9]
	3	Dennis S. Arnon , George E. Collins , Scott McCallum, Cylindrical algebraic decomposition II: an adjacency algorithm for the plane, SIAM Journal on Computing, v.13 n.4, p.878-889, Nov. 1984 [doi>10.1137/0213055]
	4	A Borodin , R Fagin , J E Hopcroft , M Tompa, Decreasing the nesting depth of expressions involving square roots, Journal of Symbolic Computation, v.1 n.2, p.169-188, June 1985 [doi>10.1006/jsco.1993.1012]
	5	Russell Bradford , Robert M. Corless , James H. Davenport , David J. Jeffrey , Stephen M. Watt, Reasoning about the Elementary Functions of Complex Analysis, Annals of Mathematics and Artificial Intelligence, v.36 n.3, p.303-318, November 2002 [doi>10.1023/A:1016007415899]
	6	George E. Collins, Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, p.134-183, May 20-23, 1975
	7	Robert M. Corless , James H. Davenport , David J. Jeffrey , Gurjeet Litt , Stephen M. Watt, Reasoning about the Elementary Functions of Complex Analysis, Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation, p.115-126, July 17-19, 2000
	8	Robert M. Corless , David J. Jeffrey , Stephen M. Watt , James H. Davenport, “According to Abramowitz and Stegun” or arccoth needn't be uncouth, ACM SIGSAM Bulletin, v.34 n.2, p.58-65, June, 2000 [doi>10.1145/362001.362023]
	9	Robert M. Corless , David J. Jeffrey, The unwinding number, ACM SIGSAM Bulletin, v.30 n.2, p.28-35, June 1996 [doi>10.1145/235699.235705]
	10	James H. Davenport , Joos Heintz, Real quantifier elimination is doubly exponential, Journal of Symbolic Computation, v.5 n.1-2, p.29-35, February/April 1988 [doi>10.1016/S0747-7171(88)80004-X]
	11	Gabrielov,A. & Vorobjov,N., Complexity of cylindrical decompositions of sub-Pfaffian sets. J. Pure Appl. Algebra164 (2001) pp. 179-197.
	12	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.
	13	Richardson,D., Some Unsolvable Problems Involving Elementary Functions of a Real Variable. Journal of Symbolic Logic33(1968), pp. 514-520.
	14	Risch,R. H., Algebraic Properties of the Elementary Functions of Analysis. Amer. J. Math.101 (1979) pp. 743-759. MR 81b:12029.
	15	Trudy Weibel , Gaston H. Gonnet, An Assume Facility for CAS, with a Sample Implementation for Maple, Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, p.95-103, April 13-15, 1992

CITED BY 5

	Ludovic Meunier , Bruno Salvy, ESF: an automatically generated encyclopedia of special functions, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.199-206, August 03-06, 2003, Philadelphia, PA, USA
	James Beaumont , Russell Bradford , James H. Davenport, Better simplification of elementary functions through power series, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.30-36, August 03-06, 2003, Philadelphia, PA, USA
	James C. Beaumont , Russell J. Bradford , James H. Davenport , Nalina Phisanbut, A poly-algorithmic approach to simplifying elementary functions, Proceedings of the 2004 international symposium on Symbolic and algebraic computation, p.27-34, July 04-07, 2004, Santander, Spain
	D. J. Jeffrey , A. C. Norman, Not seeing the roots for the branches: multivalued functions in computer algebra, ACM SIGSAM Bulletin, v.38 n.3, September 2004
	James C. Beaumont , Russell J. Bradford , James H. Davenport , Nalina Phisanbut, Adherence is better than adjacency: computing the Riemann index using CAD, Proceedings of the 2005 international symposium on Symbolic and algebraic computation, p.37-44, July 24-27, 2005, Beijing, China