On the complexity of solving ordinary differential equations in terms of Puiseux series

Simple item page
dc.creatorAyad, Ali
dc.date2007-05-15
dc.date.accessioned2026-07-07T08:01:40Z
dc.date.available2026-07-07T08:01:40Z
dc.descriptionWe 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 by Grigoriev [10] 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.
dc.identifierhttps://arxiv.org/abs/0705.2127
dc.identifierhttp://arxiv.org/abs/0705.2127
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128980
dc.subjectGeneral Mathematics
dc.titleOn the complexity of solving ordinary differential equations in terms of Puiseux series
dc.typetext

Files

Collections

arXiv