DocumentCode :
3543003
Title :
On Kahan´s Rules for Determining Branch Cuts
Author :
Chyzak, Frédéric ; Davenport, James H. ; Koutschan, Christoph ; Salvy, Bruno
Author_Institution :
Algorithms Project, Inria Rocquencourt, France
fYear :
2011
fDate :
26-29 Sept. 2011
Firstpage :
47
Lastpage :
51
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 equations; process algebra; Kahan´s rules; branch cuts; computer algebra; differential equations; Algebra; Cognition; Computers; Context; Differential equations; Equations; Printing; branch cut; computer algebra; differential equation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on
Conference_Location :
Timisoara
Print_ISBN :
978-1-4673-0207-4
Type :
conf
DOI :
10.1109/SYNASC.2011.51
Filename :
6169500
Link To Document :
بازگشت