Complexity of initial-value problems for ordinary differential equations of order \(k\) (Q2507590): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2006.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989359962 / rank
 
Normal rank

Revision as of 14:23, 19 March 2024

scientific article
Language Label Description Also known as
English
Complexity of initial-value problems for ordinary differential equations of order \(k\)
scientific article

    Statements

    Complexity of initial-value problems for ordinary differential equations of order \(k\) (English)
    0 references
    0 references
    5 October 2006
    0 references
    The worst-case \(\varepsilon\)-complexity of nonlinear initial value problem \[ u^{(k)}(x)= g(x,u(x), u'(x),\dots,u^{(q)}(x)), \quad x\in[a,b], \;0\leq q< k, \] with given initial conditions is studied. With the assumption that the function \(g\) has \(r\) \((r\geq 1)\) continuous bounded partial derivatives, two algorithms are derived (based on standard and linear information). For standard information, the worst-case complexity is \(\theta((1/\varepsilon)^{1/r})\) which is independed of \(k\) and \(q\). For linear information, the complexity is \(0((1/\varepsilon)^{1/(r+k-q)})\). So, it is proved that linear information is more powerful than standard, for \(q= 0\). A lower bound on the \(\varepsilon\)-complexity is also given for linear information \(\Omega((1/\varepsilon)^{1/(r+k)})\).
    0 references
    \(k\)th order initial-value problems
    0 references
    standard information
    0 references
    linear information
    0 references
    integral information
    0 references
    worst-case complexity
    0 references
    nonlinear initial value problem
    0 references
    algorithms
    0 references

    Identifiers