Skip to main content

Understanding Branch Cuts of Expressions

  • Conference paper
Intelligent Computer Mathematics (CICM 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7961))

Included in the following conference series:

Abstract

We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse trigonometric functions. Understanding these cuts is essential for working with the single-valued counterparts, the common approach to encoding multi-valued functions in computer algebra systems. While the defining choices are usually simple (typically portions of either the real or imaginary axes) the cuts induced by the expression may be surprisingly complicated. We have made explicit and implemented techniques for calculating the cuts in the computer algebra programme Maple. We discuss the issues raised, classifying the different cuts produced. The techniques have been gathered in the BranchCuts package, along with tools for visualising the cuts. The package is included in Maple 17 as part of the FunctionAdvisor tool.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramowitz, M., Stegun, I.A.: Handbook of mathematical functions. National Bureau of Standards (1964)

    Google Scholar 

  2. Beaumont, J., Bradford, R., Davenport, J.H., Phisanbut, N.: A poly-algorithmic approach to simplifying elementary functions. In: Proc. ISSAC 2004. ACM (2004)

    Google Scholar 

  3. Beaumont, J., Bradford, R., Davenport, J.H., Phisanbut, N.: Testing elementary function identities using CAD. Applicable Algebra in Engineering, Communication and Computing 18, 513–543 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Beaumont, J., Phisanbut, N., Bradford, R.: Practical simplification of elementary functions using CAD. In: Dolzmann, A., Seidl, A., Sturm, T. (eds.) Proc. Algorithmic Algebra and Logic, Passau (2005)

    Google Scholar 

  5. Bradford, R., Davenport, J.H.: Towards better simplification of elementary functions. In: Proc. ISSAC 2002, pp. 16–22. ACM (2002)

    Google Scholar 

  6. Bradford, R., Davenport, J.H.: Better simplification of elementary functions through power series. In: Proc. ISSAC 2003. ACM (2003)

    Google Scholar 

  7. Bradford, R., Davenport, J.H., England, M., McCallum, S., Wilson, D.: Cylindrical algebraic decompositions for boolean combinations. In Press: Proc. ISSAC 2013 (2013), Preprint at http://opus.bath.ac.uk/33926/

  8. Bradford, R., Davenport, J.H., England, M., Wilson, D.: Optimising problem formulation for cylindrical algebraic decomposition. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) CICM 2013. LNCS (LNAI), vol. 7961, pp. 19–34. Springer, Heidelberg (2013)

    Google Scholar 

  9. Carette, J., Farmer, W.M.: A review of Mathematical Knowledge Management. In: Carette, J., Dixon, L., Coen, C.S., Watt, S.M. (eds.) Calculemus/MKM 2009. LNCS, vol. 5625, pp. 233–246. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Cheb-Terrab, E.S.: The function wizard project: A computer algebra handbook of special functions. In: Proceedings of the Maple Summer Workshop. University of Waterloo, Canada (2002)

    Google Scholar 

  11. Corless, R.M., Davenport, J.H., Jeffrey, D.J., Watt, S.M.: According to Abramowitz and Stegun. SIGSAM Bulletin 34(3), 58–65 (2000)

    Article  Google Scholar 

  12. Davenport, J.H.: What might “Understand a function” mean? In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds.) MKM/CALCULEMUS 2007. LNCS (LNAI), vol. 4573, pp. 55–65. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Davenport, J.H.: The challenges of multivalued ”functions”. In: Autexier, S., Calmet, J., Delahaye, D., Ion, P.D.F., Rideau, L., Rioboo, R., Sexton, A.P. (eds.) AISC 2010. LNCS, vol. 6167, pp. 1–12. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Davenport, J.H., Bradford, R., England, M., Wilson, D.: Program verification in the presence of complex numbers, functions with branch cuts etc. In: Proc. SYNASC 2012, pp. 83–88. IEEE (2012)

    Google Scholar 

  15. Dingle, A., Fateman, R.J.: Branch cuts in computer algebra. In: Proc. ISSAC 1994, pp. 250–257. ACM (1994)

    Google Scholar 

  16. Kahan, W.: Branch cuts for complex elementary functions. In: Iserles, A., Powell, M.J.D. (eds.) Proceedings The State of Art in Numerical Analysis, pp. 165–211. Clarendon Press (1987)

    Google Scholar 

  17. Markushevich, A.I.: Theory of Functions of a Complex Variable I (translated by Silverman, R.A.). Prentice-Hall (1965)

    Google Scholar 

  18. Olver, W.J., Lozier, D.W., Boisvert, R.F., Clark, C.W. (eds.): NIST Handbook of Mathematical Functions. Cambridge University Press (2010), Print companion to [21]

    Google Scholar 

  19. Phisanbut, N.: Practical Simplification of Elementary Functions using Cylindrical Algebraic Decomposition. PhD thesis, University of Bath (2011)

    Google Scholar 

  20. Phisanbut, N., Bradford, R.J., Davenport, J.H.: Geometry of branch cuts. ACM Communications in Computer Algebra 44(3), 132–135 (2010)

    Google Scholar 

  21. National Institute for Standards and Technology. The NIST digital library of mathematical functions, http://dlmf.nist.gov Online companion to [18]

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

England, M., Bradford, R., Davenport, J.H., Wilson, D. (2013). Understanding Branch Cuts of Expressions. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds) Intelligent Computer Mathematics. CICM 2013. Lecture Notes in Computer Science(), vol 7961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39320-4_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39320-4_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39319-8

  • Online ISBN: 978-3-642-39320-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics