z-logo
open-access-imgOpen Access
Complexity of Blowup Problems
Author(s) -
Robert Rettinger,
Klaus Weihrauch,
Ning Zhong
Publication year - 2008
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2008.12.019
Subject(s) - mathematics , lipschitz continuity , interval (graph theory) , upper and lower bounds , function (biology) , domain (mathematical analysis) , geodetic datum , operator (biology) , initial value problem , order (exchange) , ordinary differential equation , combinatorics , open set , differential operator , pure mathematics , discrete mathematics , mathematical analysis , differential equation , biochemistry , chemistry , cartography , finance , repressor , evolutionary biology , gene , transcription factor , economics , biology , geography
Consider the initial value problem of the first-order ordinary differential equationddtx(t)=f(t,x(t)),x(t0)=x0 where the locally Lipschitz continuous function f:Rl+1→Rl with open domain and the initial datum (t0,x0)∈Rl+1 are given. It is shown that the solution operator producing the maximal “time” interval of existence and the solution on it is computable. Furthermore, the complexity of the blowup problem is studied for functions f defined on the whole space. For each such function f the set Z of initial conditions (t0,x0) for which the positive solution does not blow up in finite time is a Gδ-set. There is even a computable operator determining Z from f. For l⩾2 this upper Gδ-complexity bound is sharp. For l=1 the blowup problem is simpler

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom