Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients

2016/07/30 by Pouly, Amaury
#Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.1608.00135

Abstract

In this note, we extend the result of \citePoulyG16 about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in framework of Conputable Analysis \citeKo91. As a side result, we also get a uniform result about complexity of the operator, and not just about the solution.

Related

• The Radical Solution and Computational Complexity
• On the complexity of solving ordinary differential equations in terms of Puiseux series
• Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version)
• Complexity Blowup for Solutions of the Laplace and the Diffusion Equation
• Condition length and complexity for the solution of polynomial systems