Name
Abstract | ||
|---|---|---|
Considered is an interval algorithm producing bounds for the solution of the initial value problem for systems of ordinary differential equations
[(x)\dot](t) = f(t,c,x(t))\dot x(t) = f(t,c,x(t))
, x(to)=xo, involving inexact data c, xo, taking values in given intervals
$C = [\underset{\raise0.3em\hbox{$C = [\underset{\raise0.3em\hbox{\smash{\scriptscriptstyle-}$}}{c} ,\bar c]$}}{c} ,\bar c]
, resp.
= [X_o = [\underset{\raise0.3em\hbox{\smash{\scriptscriptstyle-}$}}{x} _o ,\bar x_o ]$}}{x} _o ,\bar x_o ]
. An estimate for the width of the computed inclusion of the solution set is given under the assumption that f is Lipschitzian. In addition, if f is quasi-isotone, the computed bounds converge to the interval hull of the solution set and the order of global convergence is O(h). |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1007/3-540-16437-5_10 | Proceedings of the International Symposium on interval mathematics on Interval mathematics 1985 |
Keywords | DocType | Volume |
interval method | Conference | 212 |
ISSN | ISBN | Citations |
0302-9743 | 3-387-16437-5 | 3 |
PageRank | References | Authors |
0.89 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| svetoslav markov | 1 | 11 | 2.17 |
| R Angelov | 2 | 3 | 0.89 |