| Algorithm 687: a decision tree for the numerical solution of initial value ordinary differential equations |
| Full text |
Pdf
(660 KB)
|
| Source
|
ACM Transactions on Mathematical Software (TOMS)
archive
Volume 17 , Issue 1 (March 1991)
table of contents
Pages: 1 - 10
Year of Publication: 1991
ISSN:0098-3500
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 25, Citation Count: 6
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ADDISON, C. A., ENRIGHT, W. H., GAFFNEY, P. W, GLADWELL, I., AND HANSON, P M. A decision tree for the numerical solution of initial value ordinary differential equations. Chr. Michelsen Institute~ Computer Science Rep. 86/3, revised version.
|
| |
2
|
ADDISON, C. A., ENRIGHT, W. H., GAFFNEY, P. W., GLADWELL, I.. AND HANSON, P. M A decision tree for the numerical solution of boundary value ordinary differential equations. SMU Math. Rep. 89/10.
|
 |
3
|
|
| |
4
|
|
| |
5
|
DORMAND, J. R., EL-MIKKAWY, M E. A, AND PRINCE, P J. Families of Runge-Kutta- NystrSm formulae. IMA J. Numer. Anal. 7 (1987), 235-250
|
| |
6
|
FINE, J.M. Low order Runge-Kutta-NystrSm methods with interpolants. Univ. of Toronto, Dept. of Computer Sci Tech. Rep. 183/85, 1985.
|
 |
7
|
P. W. Gaffney , C. A. Addison , B. Andersen , S. Bjørnestad , R. E. England , P. M. Hanson , R. Pickering , M. G. Thomason, NEXUS: towards a problem solving environment (PSE) for scientific computing, ACM SIGNUM Newsletter, v.21 n.3, p.13-24, July 1986
[doi> 10.1145/1057958.1057961]
|
 |
8
|
|
 |
9
|
|
| |
10
|
HALL, G , AND WATT, J. M., EDS.. Modern Numerical Methods for Ordinary Differentml Equattons. Clarendon Press, Oxford, 1976.
|
| |
11
|
HAmER, E., NORSETT, S P., AND WANNER, G Solving Ordinary Dzfferential Equations I Springer-Verlag, Berlin, 1987
|
| |
12
|
SHAMPONE, L.F. Type-insensitive ODE codes based on implicit A-stable formulas. Math Comput. 36 (1981), 499-510.
|
|