Computational complexity of solving polynomial differential equations over unbounded domains (Q264572)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of solving polynomial differential equations over unbounded domains |
scientific article; zbMATH DE number 6561612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of solving polynomial differential equations over unbounded domains |
scientific article; zbMATH DE number 6561612 |
Statements
Computational complexity of solving polynomial differential equations over unbounded domains (English)
0 references
31 March 2016
0 references
ordinary differential equations
0 references
computation with real numbers
0 references
computational complexity
0 references
adaptive Taylor algorithms
0 references
0 references
0 references
0.9467391
0 references
0.9427499
0 references
0.92958075
0 references
0.9270624
0 references
0.90046036
0 references
0.8987026
0 references
0.89794564
0 references
0.8962364
0 references
0.89254606
0 references
