Computational Complexity of Smooth Differential Equations

Journal of Applied & Computational Mathematics

article

Farago Istvan¹ 

[1] Department of Applied Analysis and Computational Mathematics, Eotvos Lorand University

关键词: Differential Equations;   

DOI  :  10.37421/jacm.2022.11.456

来源: Hilaris Publisher

【 摘 要 】

The computational intricacy of the arrangement h to the conventionaldifferential condition h (0) = 0, h (t) = g(t, h(t)) under different suppositionson the capacity g has been explored in anticipation of getting the inherenthardness of addressing the condition mathematically. Kawamura displayed in2010 that the arrangement h can be PSPACE-hard regardless of whether g isthought to be Lipschitz constant and polynomial-time calculable. We put furtherprerequisites on the perfection of g and get the accompanying outcomes: thearrangement h can in any case be PSPACE-hard on the off chance that g isthought to be of class C1; for every k ≥ 2, the arrangement h can be hard forthe counting order assuming g is of class Ck.

【 授权许可】

Unknown