On Kahan's rules for determining branch cuts

Frédéric Chyzak, James H Davenport, Christoph Koutschan, Bruno Salvy

Research output: Chapter in Book/Report/Conference proceedingChapter

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.
LanguageEnglish
Title of host publicationProc. SYNASC '11
PublisherIEEE
Number of pages5
StatusPublished - 2012

Fingerprint

Branch
Differential equation
Computer Algebra
Concepts

Keywords

  • differential equation
  • computer algebra
  • branch cut

Cite this

Chyzak, F., Davenport, J. H., Koutschan, C., & Salvy, B. (2012). On Kahan's rules for determining branch cuts. In Proc. SYNASC '11 IEEE.

On Kahan's rules for determining branch cuts. / Chyzak, Frédéric; Davenport, James H; Koutschan, Christoph; Salvy, Bruno.

Proc. SYNASC '11. IEEE, 2012.

Research output: Chapter in Book/Report/Conference proceedingChapter

Chyzak, F, Davenport, JH, Koutschan, C & Salvy, B 2012, On Kahan's rules for determining branch cuts. in Proc. SYNASC '11. IEEE.
Chyzak F, Davenport JH, Koutschan C, Salvy B. On Kahan's rules for determining branch cuts. In Proc. SYNASC '11. IEEE. 2012.
Chyzak, Frédéric ; Davenport, James H ; Koutschan, Christoph ; Salvy, Bruno. / On Kahan's rules for determining branch cuts. Proc. SYNASC '11. IEEE, 2012.
@inbook{5d03b50d3cc94b6a9d266034506630e8,
title = "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.",
keywords = "differential equation, computer algebra, branch cut",
author = "Fr{\'e}d{\'e}ric Chyzak and Davenport, {James H} and Christoph Koutschan and Bruno Salvy",
note = "SYNASC 2011. 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. September 26-29, 2011. Timisoara, Romania",
year = "2012",
language = "English",
booktitle = "Proc. SYNASC '11",
publisher = "IEEE",
address = "USA United States",

}

TY - CHAP

T1 - On Kahan's rules for determining branch cuts

AU - Chyzak,Frédéric

AU - Davenport,James H

AU - Koutschan,Christoph

AU - Salvy,Bruno

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

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - differential equation

KW - computer algebra

KW - branch cut

M3 - Chapter

BT - Proc. SYNASC '11

PB - IEEE

ER -