首页    期刊浏览 2024年11月07日 星期四
登录注册

文章基本信息

  • 标题:Topological Complexity of Blowup Problems
  • 作者:Robert Rettinger ; Klaus Weihrauch ; Ning Zhong
  • 期刊名称:Journal of Universal Computer Science
  • 印刷版ISSN:0948-6968
  • 出版年度:2009
  • 卷号:15
  • 期号:6
  • 页码:1301-1316
  • 出版社:Graz University of Technology and Know-Center
  • 摘要:Consider the initial value problem of the first-order ordinary differential equation where the locally Lipschitz continuous function with open domain and the initial datum (t0, x0) ∈ 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 topological 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 -set. There is even a computable operator determining Z from f. For l ≥ 2 this upper -complexity bound is sharp. For l = 1 the blowup problem is simpler.
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有