Branch cuts in computer algebra

  • Authors:
  • Adam Dingle;Richard J. Fateman

  • Affiliations:
  • Computer Science Division, EECS Dep't, University of California at Berkeley;Computer Science Division, EECS Dep't, University of California at Berkeley

  • Venue:
  • ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most computer algebra systems provide little assistance in working with expressions involving functions with complex branch cuts. Worse, by their ignorance of the existence of branch cuts, algebra systems sometimes simplify complex expressions incorrectly. We propose a computer representation for branch cuts; we show how a complex expression's branch cuts may be mechanically computed, and how an expression with branch cuts may sometimes be algebraically simplified within each of its branches.