Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients
Computational Complexity
2016-08-02 v1 Numerical Analysis
Abstract
In this note, we extend the result of \cite{PoulyG16} 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 \cite{Ko91}. As a side result, we also get a uniform result about complexity of the operator, and not just about the solution.
Keywords
Cite
@article{arxiv.1608.00135,
title = {Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients},
author = {Amaury Pouly},
journal= {arXiv preprint arXiv:1608.00135},
year = {2016}
}
Comments
This is a note that extends arXiv:1409.0451