• DOI:10.1016/j.tcs.2016.02.002
Corpus ID: 9793202

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

@article{Pouly2016ComputationalCO,
  title={Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients},
  author={A. Pouly},
  journal={Theor. Comput. Sci.},
  year={2016},
  volume={626},
  pages={67-82}
}

A. Pouly

Published 2016

Mathematics, Computer Science

Theor. Comput. Sci.

In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) y ' = p ( y ) over unbounded time domains, where p is a vector of polynomials. Contrarily to the bounded (compact) time case, this problem has not been well-studied, apparently due to the "intuition" that it can always be reduced to the bounded case by using rescaling techniques. However, as we show in this paper, rescaling techniques do not seem to provide meaningful insights on the… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed