Skip to main navigation Skip to search Skip to main content

On Kahan's rules for determining branch cuts

Research output: Chapter or section in a book/report/conference proceeding › Book chapter

1   Link opens in a new tab Citation (SciVal)
342 Downloads (Pure)

Abstract

In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring problems. The main focus is on the question of determining possible branch cuts. We explore the extent to which the treatment of branch cuts can be rendered (more) algorithmic, by adapting Kahan's rules to the differential equation setting.
Original languageEnglish
Title of host publicationProc. SYNASC '11
PublisherIEEE
Number of pages5
Publication statusPublished - 2012

Bibliographical note

SYNASC 2011. 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. September 26-29, 2011. Timisoara, Romania

Keywords

  • differential equation
  • computer algebra
  • branch cut

Fingerprint

Dive into the research topics of 'On Kahan's rules for determining branch cuts'. Together they form a unique fingerprint.

Cite this