Skip to Main content Skip to Navigation
Conference papers

On Kahan's Rules for Determining Branch Cuts

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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00623044
Contributor : Bruno Salvy Connect in order to contact the contributor
Submitted on : Tuesday, November 29, 2011 - 8:38:00 AM
Last modification on : Thursday, February 3, 2022 - 11:18:26 AM
Long-term archiving on: : Monday, December 5, 2016 - 7:02:57 AM

Files

FunctionsvG-hal-arXiv.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00623044, version 2
  • ARXIV : 1109.2809

Collections

Citation

Frédéric Chyzak, James Davenport, Christoph Koutschan, Bruno Salvy. On Kahan's Rules for Determining Branch Cuts. SYNASC 2011. 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing., Sep 2011, Timisoara, Romania. pp.47-51. ⟨inria-00623044v2⟩

Share

Metrics

Record views

97

Files downloads

881