Branch cuts in maple 17

  title={Branch cuts in maple 17},
  author={Matthew England and Edgardo S. Cheb-Terrab and Russell J. Bradford and James H. Davenport and David J. Wilson},
  journal={ACM Commun. Comput. Algebra},
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. 

Figures from this paper

Truth table invariant cylindrical algebraic decomposition
Visual Analysis of the Newton's Method with Fractional Order Derivatives
The aim of this paper is to investigate experimentally and to present visually the dynamics of the processes in which in the standard Newton’s root-finding method the classic derivative is replaced
Advances in cylindrical algebraic decomposition
A prototype software CADassistant is described to help users take advantage of the advances without knowledge of the underlying theory, to improve the practical efficiency of CAD for a variety of problems.
A Fall 2019 The complex inverse trigonometric and hyperbolic functions
  • Mathematics
  • 2019
In these notes, we examine the inverse trigonometric and hyperbolic functions, where the arguments of these functions can be complex numbers. These are all multivalued functions. We also carefully
Improving the Representation and Conversion of Mathematical Formulae by Considering their Textual Context
This work analyzes how the semantic enrichment of formulae improves the format conversion process and shows that considering the textual context of formULae reduces the error rate of such conversions.
Semantic Preserving Bijective Mappings for Expressions involving Special Functions in Computer Algebra Systems and Document Preparation Systems
This paper introduces the first translation tool for special functions between LaTeX and CAS, which improves error-prone manual translations and can be used to verify mathematical online compendia and CAS.
The complex inverse trigonometric and hyperbolic functions
In these notes, we examine the inverse trigonometric and hyperbolic functions, where the arguments of these functions can be complex numbers. The multivalued functions are defined in terms of the
Automatic Mathematical Information Retrieval to Perform Translations up to Computer Algebra Systems
The envisioned method will automatically semantically enrich mathematical expressions so that they can be imported to computer algebra systems and other systems that can take advantage of the semantics, such as search engines or automatic plagiarism detection systems.
Comparative Verification of the Digital Library of Mathematical Functions and Computer Algebra Systems
This paper uses a previously developed conversion tool to translate formulae from the NIST Digital Library of Mathematical Functions to the computer algebra systems Maple and Mathematica, and presents the most comprehensive verification ofComputer algebra systems and digital mathematical libraries with one another.


Understanding Branch Cuts of Expressions
This work has made explicit and implemented techniques for calculating the cuts in the computer algebra programme Maple, and gathered them in the BranchCuts package, along with tools for visualising the cuts.
Towards better simplification of elementary functions
An algorithm for simplifying a large class of elementary functions in the presence of branch cuts that can be interfaced to an assume facility, and can verify that simplifications are valid "almost everywhere".
Branch cuts in computer algebra
A computer representation for branch cuts is proposed; it is shown how a complex expression's branch cuts may be mechanically computed, and how an expression with branch cut may sometimes be algebraically simplified within each of its branches.
Cylindrical algebraic decompositions for boolean combinations
This article generalises the theory of equational constraints to design an algorithm which will efficiently construct a TTICAD for a wide class of problems, producing stronger results than when using equational constraint alone.
The challenges of multivalued "Functions"
  • J. Davenport
  • Computer Science
  • 2010
This paper looks at the steps necessary to convert existing texts into rigorous statements, and asks whether there might be a constant "de Bruijn factor" as they make these texts more formal, and concludes that the answer depends greatly on the interpretation being placed on the symbols.
Program Verification in the Presence of Complex Numbers, Functions with Branch Cuts etc
There is a class of problems that fall between these two, which could be described as does the low-level arithmetic implement the high-level mathematics, and there is still a long way to go before implementations match the theoretical possibilities.
NIST Handbook of Mathematical Functions
This handbook results from a 10-year project conducted by the National Institute of Standards and Technology with an international group of expert authors and validators and is destined to replace its predecessor, the classic but long-outdated Handbook of Mathematical Functions, edited by Abramowitz and Stegun.
“According to Abramowitz and Stegun” or arccoth needn't be uncouth
The concept of a couth pair of definitions is introduced, e.g. of arcsin and arcsinh, and it is shown that the pair arccot and arccoth can be couth.
Handbook Of Mathematical Functions
The handbook of mathematical functions is universally compatible with any devices to read and is available in the digital library an online access to it is set as public so you can get it instantly.
  • Computer Science
    Brain Research Bulletin
  • 1986