Loading...
Please wait, while we are loading the content...
Puiseux series solutions of ordinary polynomial differential equations: complexity study (2010).
| Content Provider | CiteSeerX |
|---|---|
| Author | Ayad, Ali |
| Description | This content is published in/by ACTA UNIVERSITATIS APULENSIS |
| Abstract | We prove that the binary complexity of solving ordinary polynomial differential equations in terms of Puiseux series is single exponential in the number of terms in the series. Such a bound was given in 1990 by Grigoriev for Riccatti differential polynomials associated to ordinary linear differential operators. In this paper, we get the same bound for arbitrary differential polynomials. The algorithm is based on a differential version of the Newton-Puiseux procedure for algebraic equations. |
| File Format | |
| Publisher Date | 2010-01-01 |
| Access Restriction | Open |
| Subject Keyword | Complexity Study Arbitrary Differential Polynomial Algebraic Equation Single Exponential Ordinary Linear Differential Operator Riccatti Differential Polynomial Binary Complexity Ordinary Polynomial Differential Equation Newton-puiseux Procedure Puiseux Series Differential Version |
| Content Type | Text |
