Computer Science – Symbolic Computation
Scientific paper
2011-09-13
Computer Science
Symbolic Computation
SYNASC 2011. 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. (2011)
Scientific paper
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.
Chyzak Frédéric
Davenport James
Koutschan Christoph
Salvy Bruno
No associations
LandOfFree
On Kahan's Rules for Determining Branch Cuts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Kahan's Rules for Determining Branch Cuts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Kahan's Rules for Determining Branch Cuts will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-334073