# 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} }

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

#### Supplemental Presentations

#### Topics from this paper

15 Citations

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

- Mathematics, Computer Science
- J. ACM
- 2017

18- PDF

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations

- Mathematics, Computer Science
- ICALP
- 2016

10- PDF

Are numerical theories irreplaceable? A computational complexity analysis

- Physics, Mathematics
- 2017

- PDF

Parametrised second-order complexity theory with applications to the study of interval computation

- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2020

6- PDF

A Universal Ordinary Differential Equation

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2020

- PDF

Explorer Computing continuous time Markov chains as transformers of unbounded observation functions

- 2017

- PDF

A new multistage technique for approximate analytical solution of nonlinear differential equations

- Mathematics, Medicine
- Heliyon
- 2020

#### References

SHOWING 1-10 OF 43 REFERENCES

Computational bounds on polynomial differential equations

- Mathematics, Computer Science
- Appl. Math. Comput.
- 2009

14- PDF

Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete

- Mathematics, Computer Science
- 2009 24th Annual IEEE Conference on Computational Complexity
- 2009

30- PDF

Effective Computability of Solutions of Differential Inclusions The Ten Thousand Monkeys Approach

- Computer Science
- J. Univers. Comput. Sci.
- 2009

24- PDF

Computational complexity of one-step methods for a scalar autonomous differential equation

- Mathematics, Computer Science
- Computing
- 2005

4

Adaptivity and computational complexity in the numerical solution of ODEs

- Mathematics, Computer Science
- J. Complex.
- 2008

27- PDF

Breaking the limits: The Taylor series method

- Mathematics, Computer Science
- Appl. Math. Comput.
- 2011

48- PDF

An Effective Cauchy-Peano Existence Theorem for Unique Solutions

- Mathematics, Computer Science
- Int. J. Found. Comput. Sci.
- 1996

26

Complexity Theory of Real Functions

- Mathematics, Computer Science
- Progress in Theoretical Computer Science
- 1991

514 Highly Influential