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 | Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2011) |
| Editors | Dongming Wang et al. |
| Publisher | IEEE Computer Society - Conference Publishing Services (CPS) |
| Pages | 47-51 |
| Number of pages | 5 |
| ISBN (Print) | 978-0-7695-4630-8 |
| Publication status | Published - 2011 |
Fields of science
- 101001 Algebra
- 101002 Analysis
- 101 Mathematics
- 102 Computer Sciences
- 102011 Formal languages
- 101009 Geometry
- 101013 Mathematical logic
- 101020 Technical mathematics
- 101025 Number theory
- 101012 Combinatorics
- 101005 Computer algebra
- 101006 Differential geometry
- 101003 Applied geometry
- 102025 Distributed systems
JKU Focus areas
- Computation in Informatics and Mathematics