On the complexity of solving initial value problems

Details On the complexity of solving initial value problems On the complexity of solving initial value problems

2012-02-20

arxiv.org/abs/1202.4407v1

Computer Science

Numerical Analysis

8 pages (two columns per page), submitted to ISSAC'12 conference

Scientific paper

In this paper we prove that computing the solution of an initial-value problem $\dot{y}=p(y)$ with initial condition $y(t_0)=y_0\in\R^d$ at time $t_0+T$ with precision $e^{-\mu}$ where $p$ is a vector of polynomials can be done in time polynomial in the value of $T$, $\mu$ and $Y=\sup_{t_0\leqslant u\leqslant T}\infnorm{y(u)}$. Contrary to existing results, our algorithm works for any vector of polynomials $p$ over any bounded or unbounded domain and has a guaranteed complexity and precision. In particular we do not assume $p$ to be fixed, nor the solution to lie in a compact domain, nor we assume that $p$ has a Lipschitz constant.

Affiliated with

Also associated with

No associations

Rating

On the complexity of solving initial value problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of solving initial value problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of solving initial value problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-565626