On Kahan's rules for determining branch cuts
Chyzak, F., Davenport, J. H., Koutschan, C. and Salvy, B., 2012. On Kahan's rules for determining branch cuts. In: Proc. SYNASC '11. IEEE Press.
Related documents:This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.
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.
|Item Type||Book Sections|
|Creators||Chyzak, F., Davenport, J. H., Koutschan, C. and Salvy, B.|
|Uncontrolled Keywords||differential equation, computer algebra, branch cut|
|Departments||Faculty of Science > Computer Science|
|Publisher Statement||FunctionsvF.pdf: © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, 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 component of this work in other works.|
|Additional Information||SYNASC 2011. 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. September 26-29, 2011. Timisoara, Romania|
Actions (login required)