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
    15 Citations

    Topics from this paper

    Are numerical theories irreplaceable? A computational complexity analysis
    • PDF
    A Universal Ordinary Differential Equation
    • 9
    • PDF
    A Universal Ordinary Differential Equation
    • PDF
    Computability of Ordinary Differential Equations
    • 1
    • PDF
    A new multistage technique for approximate analytical solution of nonlinear differential equations
    Sailing Routes in the World of Computation
    • 1

    References

    SHOWING 1-10 OF 43 REFERENCES
    Computational bounds on polynomial differential equations
    • 14
    • PDF
    SOME PROPERTIES OF SOLUTIONS TO POLYNOMIAL SYSTEMS OF DIFFERENTIAL EQUATIONS
    • 34
    • PDF
    Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
    • A. Kawamura
    • Mathematics, Computer Science
    • 2009 24th Annual IEEE Conference on Computational Complexity
    • 2009
    • 30
    • PDF
    Adaptivity and computational complexity in the numerical solution of ODEs
    • 27
    • PDF
    Breaking the limits: The Taylor series method
    • 48
    • PDF
    An Effective Cauchy-Peano Existence Theorem for Unique Solutions
    • K. Ruohonen
    • Mathematics, Computer Science
    • Int. J. Found. Comput. Sci.
    • 1996
    • 26
    Computability, noncomputability and undecidability of maximal intervals of IVPs
    • 39
    • PDF
    Complexity Theory of Real Functions
    • K. Ko
    • Mathematics, Computer Science
    • Progress in Theoretical Computer Science
    • 1991
    • 514
    • Highly Influential