On Kahan's rules for determining branch cuts

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

On Kahan's rules for determining branch cuts

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

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

1 Citation (SciVal)

193 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 language	English
Title of host publication	Proc. SYNASC '11
Publisher	IEEE
Number of pages	5
Publication status	Published - 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

Access to Document

FunctionsvF
© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works
Accepted author manuscript, 227 KB

Cite this

@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 or section

BT - Proc. SYNASC '11

PB - IEEE

ER -

On Kahan's rules for determining branch cuts

Abstract

Bibliographical note

Keywords

Access to Document

Fingerprint

Cite this