column

Branch cuts in maple 17

Authors:

D. WilsonAuthors Info & Claims

ACM Communications in Computer Algebra, Volume 48, Issue 1/2

Pages 24 - 27

https://doi.org/10.1145/2644288.2644293

Published: 10 July 2014 Publication History

Get Access

Abstract

Accurate and comprehensible knowledge about the position of branch cuts is essential for correctly working with multi-valued functions, such as the square root and logarithm. We discuss the new tools in Maple 17 for calculating and visualising the branch cuts of such functions, and others built up from them. The cuts are described in an intuitive and accurate form, offering substantial improvement on the descriptions previously available.

References

[1]

M. Abramowitz and I.A. Stegun. Handbook of mathematical functions. National Bureau of Standards, 1964.

Digital Library

Google Scholar

[2]

R. Bradford and J.H. Davenport. Towards better simplification of elementary functions. In Proceedings of ISSAC '02, pages 16--22, 2002.

Digital Library

Google Scholar

[3]

R. Bradford, J.H. Davenport, M. England, S. McCallum, and D. Wilson. Cylindrical algebraic decompositions for boolean combinations. In Proceedings of ISSAC '13, pages 125--132, 2013.

Digital Library

Google Scholar

[4]

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

Google Scholar

[5]

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

Digital Library

Google Scholar

[6]

J.H. Davenport. The challenges of multivalued "functions". In Intelligent Computer Mathematics, LNCS:6167, pages 1--12, Springer, 2010.

Digital Library

Google Scholar

[7]

J.H. Davenport, R. Bradford, M. England, and D. Wilson. Program verification in the presence of complex numbers, functions with branch cuts etc. In Proceedings of SYNASC '12, pages 83--88. IEEE, 2012.

Digital Library

Google Scholar

[8]

A. Dingle and R.J. Fateman. Branch cuts in computer algebra. In Proceedings of ISSAC '94, pages 250--257, 1994.

Digital Library

Google Scholar

[9]

M. England, R. Bradford, J.H. Davenport, and D. Wilson. Understanding branch cuts of expressions. In Intelligent Computer Mathematics, LNCS:7961, pages 136--151, Springer, 2013.

Digital Library

Google Scholar

[10]

W.J. Olver, D.W. Lozier, R.F. Boisvert, and C.W. Clark, editors. NIST Handbook of Mathematical Functions. Cambridge University Press, 2010. Online version at http://dlmf.nist.gov

Digital Library

Google Scholar

Cited By

View all

Ferres-López ERoanes-Lozano EMartínez-Zarzuelo ASánchez F(2023)One-sided differentiability: a challenge for computer algebra systemsElectronic Research Archive10.3934/era.202309031:3(1737-1768)Online publication date: 2023
https://doi.org/10.3934/era.2023090
Gdawiec KKotarski WLisowska A(2019)Visual Analysis of the Newton’s Method with Fractional Order DerivativesSymmetry10.3390/sym1109114311:9(1143)Online publication date: 9-Sep-2019
https://doi.org/10.3390/sym11091143
Greiner-Petter ASchubotz MCohl HGipp B(2019)Semantic preserving bijective mappings for expressions involving special functions between computer algebra systems and document preparation systemsAslib Journal of Information Management10.1108/AJIM-08-2018-0185Online publication date: 31-May-2019
https://doi.org/10.1108/AJIM-08-2018-0185
Show More Cited By

Index Terms

Branch cuts in maple 17
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Computer algebra systems
2. Mathematics of computing
  1. Mathematical software

Recommendations

On the Rank of Disjunctive Cuts

Let L be a family of lattice-free polyhedra in R^m containing the splits. Given a polyhedron P in R^{m + n}, we characterize when a valid inequality for P ∩ (Z^m × Rⁿ) can be obtained with a finite number of disjunctive cuts corresponding to the polyhedra in ...
Computing generalized ham-sandwich cuts

Barany et al. (2008) [1] proved that, for any @b@?[0,1]^d and any d well-separated convex bodies S"1,S"2,...,S"d in R^d, there exists a hyperplane (a generalized ham-sandwich cut) splitting the volume of S"i as (@b"i,1-@b"i) for all i. Steiger and Zhao (...
Computational Experiments with Cross and Crooked Cross Cuts

<P>In this paper, we study whether cuts obtained from two simplex tableau rows at a time can strengthen the bounds obtained by Gomory mixed-integer (GMI) cuts based on single tableau rows. We also study whether cross and crooked cross cuts, which ...

Comments

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra

ACM Communications in Computer Algebra Volume 48, Issue 1/2

March/June 2014

70 pages

ISSN:1932-2240

DOI:10.1145/2644288

Editors:
Eugene Zima
Wilfrid Laurier University, Waterloo ON, Canada
,
Massimo Caboara
Università di Genova, Italy
,
Jean-Guillaume Dumas
Université Joseph Fourier, Grenoble, France
,
Gonzalez-Vega Gonzalez-Vega
Universidad de Cantabria, Santander, Spain
,
Michael Wester
Cotopaxi, Albuquerque NM, USA
,
Lihong Zhi
Academia Sinica, Beijing, China

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 July 2014

Published in SIGSAM-CCA Volume 48, Issue 1/2

Check for updates

Qualifiers

Column

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
70
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ferres-López ERoanes-Lozano EMartínez-Zarzuelo ASánchez F(2023)One-sided differentiability: a challenge for computer algebra systemsElectronic Research Archive10.3934/era.202309031:3(1737-1768)Online publication date: 2023
https://doi.org/10.3934/era.2023090
Gdawiec KKotarski WLisowska A(2019)Visual Analysis of the Newton’s Method with Fractional Order DerivativesSymmetry10.3390/sym1109114311:9(1143)Online publication date: 9-Sep-2019
https://doi.org/10.3390/sym11091143
Greiner-Petter ASchubotz MCohl HGipp B(2019)Semantic preserving bijective mappings for expressions involving special functions between computer algebra systems and document preparation systemsAslib Journal of Information Management10.1108/AJIM-08-2018-0185Online publication date: 31-May-2019
https://doi.org/10.1108/AJIM-08-2018-0185
Schubotz MGreiner-Petter AScharpf PMeuschke NCohl HGipp BChen JGonçalves MAllen JFox EKan MPetras V(2018)Improving the Representation and Conversion of Mathematical Formulae by Considering their Textual ContextProceedings of the 18th ACM/IEEE on Joint Conference on Digital Libraries10.1145/3197026.3197058(233-242)Online publication date: 23-May-2018
https://dl.acm.org/doi/10.1145/3197026.3197058

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On the Rank of Disjunctive Cuts

Computing generalized ham-sandwich cuts

Computational Experiments with Cross and Crooked Cross Cuts