Numerical Methods for Ordinary Differential Equations

Numerical Methods for Ordinary Differential Equations

Volumn , Issue , 2016, Pages 1-513

  Butcher, J C ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INITIAL VALUE PROBLEMS; NUMERICAL METHODS; ORDINARY DIFFERENTIAL EQUATIONS;

APPLIED MATHEMATICS; COMPUTATIONAL SCIENCE; GENERAL LINEAR METHODS; LONG-TERM INTEGRATION; MECHANICAL SYSTEMS; NUMERICAL SCHEME; PRECISE ANALYSIS; SYMPLECTIC METHODS;

RUNGE KUTTA METHODS;

EID: 85019304409     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9781119121534     Document Type: Book

References (163)

1. Ahlfors L. V. (1978) Complex analysis. McGraw-Hill.
2. Alexander R. (1977) Diagonally implicit Runge-Kutta methods for stiff ODEs. SIAM J. Numer. Anal., 14, 1006-1021.
3. Axelsson O. (1969) A class of A-stable methods. BIT, 9, 185-199.
4. Axelsson O. (1972) A note on class of strongly A-stable methods. BIT, 12, 1-4.
5. Barton D., Willers I. M. and Zahar R. V. M. (1971) The automatic solution of systems of ordinary differential equations by the method of Taylor series. Comput. J., 14, 243-248.
6. Bashforth F. and Adams J. C. (1883) An Attempt to Test the Theories of Capillary Action by Comparing the Theoretical and Measured Forms of Drops of Fluid, with an Explanation of the Method of Integration Employed in Constructing the Tables which Give the Theoretical Forms of Such Drops. Cambridge University Press, Cambridge.
7. Brenan K. E., Campbell S. L. and Petzold L. R. (1996) Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations. North-Holland, New York.
8. Brouder C. (2000) Runge-Kutta methods and renormalization. Eur. Phys. J. C., 12, 521-534.
9. Burrage K. (1978) A special family of Runge-Kutta methods for solving stiff differential equations. BIT, 18, 22-41.
10. Burrage K. and Butcher J. C. (1980) Non-linear stability of a general class of differential equation methods. BIT, 20, 185-203.
11. Burrage K., Butcher J. C. and Chipman F. H. (1980) An implementation of singlyimplicit Runge-Kutta methods. BIT, 20, 326-340.
12. Butcher J. C. (1963a) Coefficients for the study of Runge-Kutta integration processes. J. Austral. Math. Soc., 3, 185-201.
13. Butcher J. C. (1963b) On the integration processes of A. Huta. J. Austral. Math. Soc., 3, 202-206.
14. Butcher J. C. (1964) Implicit Runge-Kutta processes. Math. Comp., 18, 50-64.
15. Butcher J. C. (1964) Integration processes based on Radau quadrature formulas. Math. Comp., 18, 233-244.
16. Butcher J. C. (1965a) A modified multistep method for the numerical integration of ordinary differential equations. J. Assoc. Comput. Mach., 12, 124-135.
17. Butcher J. C. (1965b) On the attainable order of Runge-Kutta methods. Math. Comp., 19, 408-417.
18. Butcher J. C. (1966) On the convergence of numerical solutions to ordinary differential equations. Math. Comp., 20, 1-10.
19. Butcher J. C. (1972) An algebraic theory of integration methods. Math. Comp., 26, 79-106.
20. Butcher J. C. (1975) A stability property of implicit Runge-Kutta methods. BIT, 15, 358-361.
21. Butcher J. C. (1977) On A-stable implicit Runge-Kutta methods. BIT, 17, 375-378.
22. Butcher J. C. (1979) A transformed implicit Runge-Kutta method. J. Assoc. Comput. Mach., 26, 731-738.
23. Butcher J. C. (1985) The nonexistence of ten-stage eighth order explicit Runge- Kutta methods. BIT, 25, 521-540.
24. Butcher J. C. (1987) The Numerical Analysis of Ordinary Differential Equations, Runge-Kutta and General Linear Methods. JohnWiley & Sons Ltd, Chichester.
25. Butcher J. C. (1987b) The equivalence of algebraic stability and AN-stability. BIT, 27, 510-533.
26. Butcher J. C. (1995a) On fifth order Runge-Kutta methods. BIT, 35, 202-209.
27. Butcher J. C. (1995b) An introduction to DIMSIMs. Comput. Appl. Math., 14, 59-72.
28. Butcher J. C. (1997) An introduction to 'Almost Runge-Kutta' methods. Appl. Numer. Math., 24, 331-342.
29. Butcher J. C. (1998) ARK methods up to order five. Numer. Algorithms, 17, 193-221.
30. Butcher J. C. (2001) General linear methods for stiff differential equations. BIT, 41, 240-264.
31. Butcher J. C. (2002) The A-stability of methods with Padé and generalized Padé stability functions. Numer. Algorithms, 31, 47-58.
32. Butcher J. C. (2006) General linear methods. Acta Numerica, 15, 157-256.
33. Butcher J. C. (2009) Order and stability of generalized Padé approximations. Appl. Numer. Math., 59, 558-567.
34. Butcher J. C. (2013) Dealing with parasitic behaviour in G-symplectic integrators. In Recent developments in the Numerics of Nonlinear Hyperbolic Conservation Laws, Notes on Numerical Fluid Mechanics and Multidisciplinary Design, Springer, Berlin, 105-123.
35. Butcher J C. (2015) The cohesiveness of G-symplecticmethods. Numer. Algorithms, 70, 607-624.
36. Butcher J. C. and Cash J. R. (1990) A generalization of singly-implicit Runge-Kutta methods. SIAM J. Numer. Anal., 27, 753-761.
37. Butcher J. C. and Chan T. M N. (2010) The tree and forest spaces with applications to initial-value problem methods. BIT Numer. Math., 50, 713-728.
38. Butcher J. C. and Chartier P. (1997) A generalization of singly-implicit Runge- Kutta methods. Appl. Numer. Math., 24, 343-350.
39. Butcher J. C. and Chipman F. H. (1992) Generalized Padé approximations to the exponential function. BIT, 32, 118-130.
40. Butcher J. C., Corless R. M., Gonzalez-Vega L. and Shakoori A. (2011) Polynomial algebra for Birkhoff interpolants. Numer. Algorithms, 56, 319-347.
41. Butcher J. C., Habib Y., Hill A. T. and Norton T. J. T. (2014) The control of parasitism in G-symplectic methods. SIAM J. Numer. Anal., 52, 2440-2465.
42. Butcher J. C. and Hill A. T. (2006) Linear multistep methods as irreducible general linear methods. BIT, 46, 5-19.
43. Butcher J. C., Hill A. T. and Norton T. J. T, (2015) Symmetric general linear methods. BIT Numer. Math. DOI :10.1007/s10543-016-0613-1.
44. Butcher J. C. and Imran G. (2015) Order conditions for G-symplectic methods. BIT Numer. Math., 55, 927-948.
45. Butcher J. C., Imran G. and Podhaisky H. (2016) A G-symplectic method of order 6. (submitted).
46. Butcher J. C. and Jackiewicz Z. (1996) Construction of diagonally implicit general linear methods of type 1 and 2 for ordinary differential equations. Appl. Numer. Math., 21, 385-415.
47. Butcher J. C. and Jackiewicz Z. (1998) Construction of high order diagonally implicit multistage integration methods for ordinary differential equations. Appl. Numer. Math., 27, 1-12.
48. Butcher J. C. and Jackiewicz Z. (2003) A new approach to error estimation for general linear methods. Numer. Math., 95, 487-502.
49. Butcher J. C. and Moir N. (2003) Experiments with a new fifth order method. Numer. Algorithms, 33, 137-151 .
50. Butcher J. C. and Podhaisky H. (2006)On error estimation in general linear methods for stiff ODEs. Appl. Numer. Math., 56, 345-357.
51. Butcher J. C. and Rattenbury N. (2005) ARK methods for stiff problems. Appl. Numer. Math., 53, 165-181 .
52. Butcher J. C. and Wright W. M. (2003) A transformation relating explicit and diagonally-implicit general linear methods. Appl. Numer. Math., 44, 313-327.
53. Butcher J. C. andWright W. M. (2003a) The construction of practical general linear methods. BIT, 43, 695-721.
54. Butcher J. C. andWright W. M. (2006) Applications of doubly companion matrices. Appl. Numer. Math., 56, 358-373.
55. Byrne G. D. and Lambert R. J. (1966) Pseudo-Runge-Kutta methods involving two points. J. Assoc. Comput. Mach., 13, 114-123.
56. Cooper G. J. (1987) Stability of Runge-Kutta methods for trajectory problems. IMA J. Numer. Anal., 7, 1-13.
57. Cooper G. J. and Verner J. H. (1972) Some explicit Runge-Kutta methods of high order. SIAM J. Numer. Anal., 9, 389-405.
58. Curtis A. R. (1970) An eighth order Runge-Kutta process with eleven function evaluations per step. Numer. Math., 16, 268-277.
59. Curtis A. R. (1975) High-order explicit Runge-Kutta formulae, their uses and limitations. J. Inst. Math. Appl., 16, 35-55.
60. Curtiss C. F. and Hirschfelder J. O. (1952) Integration of stiff equations. Proc. Nat. Acad. Sci. U.S.A., 38, 235-243.
61. Dahlquist G. (1956) Convergence and stability in the numerical integration of ordinary differential equations. Math. Scand., 4, 33-53.
62. Dahlquist G. (1963) A special stability problem for linear multistep methods. BIT, 3, 27-43.
63. Dahlquist G. (1976) Error analysis for a class of methods for stiff non-linear initial value problems. In G. A. Watson (ed.) Numerical Analysis, Lecture Notes in Math. 506, Springer, Berlin, 60-72.
64. Dahlquist G. (1978) G-stability is equivalent to A-stability. BIT, 18, 384-401.
65. Dahlquist G. (1983) On one-leg multistep methods. SIAM J. Numer. Anal., 20, 1130-1138.
66. Dahlquist G. and Jeltsch R. (1979) Generalized disks of contractivity for explicit and implicit Runge-Kutta methods, Technical Report TRITA NA-7906, Dept. of Numer. Anal. and Computing Sci., Roy. Inst. Tech.
67. D'Ambrosio R. and Hairer E. (2014) Long-term stability of multi-value methods for ordinary differential equations. J. Sci. Comput., 60, 627-640.
68. Daniel J. W. and Moore R. E. (1970) Computation and Theory in Ordinary Differential Equations.W. H. Freeman, San Francisco.
69. Davis P. J. and Rabinowitz P. (1984) Methods of Numerical Integration. Academic Press, New York.
70. Donelson J. and Hansen E. (1971) Cyclic composite multistep predictor-corrector methods. SIAM J. Numer. Anal., 8, 137-157.
71. Dormand J. R. and Prince P. J. (1980) A family of embedded Runge-Kutta formulae. J. Comput Appl, Math., 6, 19-26.
72. Ehle B. L. (1969) On Padé approximations to the exponential function and A-stable methods for the numerical solution of initial value problems, Research Rep. CSRR 2010, Dept. of AACS, University ofWaterloo, Ontario, Canada.
73. Ehle B. L. (1973) A-stable methods and Padé approximations to the exponential. SIAM J. Math. Anal., 4, 671-680.
74. Ehle B. L. and Picel Z. (1975) Two parameter, arbitrary order, exponential approximations for stiff equations. Math. Comp., 29, 501-511.
75. Euler L. (1913) De integratione aequationum differentialium per approximationem. In Opera Omnia, 1st series, Vol. 11, Institutiones Calculi Integralis, Teubner, Leipzig and Berlin, 424-434.
76. Fehlberg E. (1968) Classical fifth, sixth, seventh and eighth order Runge-Kutta formulas with stepsize control, NASA TR R-287.
77. Fehlberg E. (1969) Klassische Runge-Kutta-Formeln f ünfter und siebenter Ordnung mit Schrittweiten-Kontrolle. Computing, 4, 93-106.
78. de Frutos J. and Sanz-Serna J. M. (1992) An easily implementable fourth-order method for the time integration of wave problems. J. Comput. Phys., 103, 160-168.
79. Gear C. W. (1965) Hybrid methods for initial value problems in ordinary differential equations. SIAM J. Numer. Anal., 2, 69-86.
80. Gear C. W. (1967) The numerical integration of ordinary differential equations. Math. Comp., 21, 146-156.
81. Gear C. W. (1971a) Numerical Initial Value Problems in Ordinary Differential Equations. Prentice Hall, Englewood Cliffs, NJ.
82. Gear C. W. (1971b) Algorithm 407, DIFSUB for solution of ordinary differential equations. Comm. ACM, 14, 185-190.
83. Gear C. W. (1980) Runge-Kutta starters for multistep methods. ACM Trans. Math. Software, 6, 263-279.
84. Gibbons A. (1960) A program for the automatic integration of differential equations using the method of Taylor series. Comput. J., 3, 108-111.
85. Gill S. (1951) A process for the step-by-step integration of differential equations in an automatic computing machine. Proc. Cambridge Philos. Soc., 47, 96-108.
86. Gragg W. B. and Stetter H. J. (1964) Generalized multistep predictor-corrector methods. J. Assoc. Comput. Mach., 11, 188-209.
87. Gustafsson K. (1991) Control theoretic techniques for stepsize selection in explicit Runge-Kutta methods. ACM Trans. Math. Software, 17, 533-544.
88. Gustafsson K., Lundh M. and Söderlind G. (1988) A PI stepsize control for the numerical solution of ordinary differential equations. BIT, 28, 270-287.
89. Hairer E. (1978) A Runge-Kuttamethod of order 10. J. Inst.Math. Appl., 21, 47-59.
90. Hairer E. (2006) Symmetric linear multistep methods. BIT, 46, 515-524.
91. Hairer E. and Leone P. (2000) Some properties of symplectic Runge-Kuttamethods. NZ J. Math., 29, 169-175.
92. Hairer E. and Lubich C. (2004) Symmetric multistep methods over long times. Numer. Math., 97, 699-723.
93. Hairer E., Lubich C. and Roche M. (1989) The Numerical Solution of Differential- Algebraic Systems by Runge-Kutta Methods, Lecture Notes in Math. 1409. Springer, Berlin.
94. Hairer E., Lubich C. and Wanner G. (2006) Geometric Numerical Integration: Structure-preserving Algorithms for Ordinary Differential Equations. Springer, Berlin.
95. Hairer E., Nørsett S. P. and Wanner G. (1993) Solving Ordinary Differential Equations I: Nonstiff Problems. Springer, Berlin.
96. Hairer E. and Wanner G. (1974) On the Butcher group and general multi-value methods. Computing, 13, 1-15.
97. Hairer E. and Wanner G. (1981) Algebraically stable and implementable Runge- Kutta methods of high order. SIAM J. Numer. Anal., 18, 1098-1108.
98. Hairer E. and Wanner G. (1982) Characterization of non-linearly stable implicit Runge-Kutta methods. In J. Hinze (ed.) Numerical Integration of Differential Equations and Large Linear Systems, Lecture Notes in Math. 968, Springer, Berlin, 207-219.
99. Hairer E. andWanner G. (1996) Solving ordinary differential equations. II: Stiff and differential-algebraic problems. Springer, Berlin.
100. Hairer E. and Wanner G. (2010) Linear multistep method. Scholarpedia, 5(4), 4591.
101. Henrici P. (1962) Discrete Variable Methods in Ordinary Differential Equations. JohnWiley & Sons Inc, New York.
102. Henrici P. (1963) Error Propagation for Difference Methods. John Wiley & Sons Inc, New York.
103. Heun K. (1900) Neue Methoden zur approximativen Integration der Differentialgleichungen einer unabhängigen Veränderlichen. Z. Math. Phys., 45, 23-38.
104. Higham N. J. (1993) The accuracy of floating point summation. SIAM J. Sci. Comput., 14, 783-799.
105. HundsdorferW. H. and Steininger B. I. (1991) Convergence of linear multistep and one-leg methods for stiff nonlinear initial value problems. BIT, 31, 124-143.
106. Huta A. (1956) Une amélioration de la méthode de Runge-Kutta-Nyström pour la résolution numérique des équations différentielles du premier ordre. Acta Fac. Nat. Univ. Comenian. Math., 1, 201-224.
107. Huta A. (1957) Contribution à la formule de sixi`eme ordre dans la méthode de Runge-Kutta-Nyström. Acta Fac. Nat. Univ. Comenian. Math., 2, 21-24.
108. Iserles A., Munthe-Kaas H. Z., Nørsett S. P. and Zanna A. (2000) Lie-group methods. Acta Numer., 9, 215-365.
109. Iserles A. and Nørsett S. P. (1991) Order Stars. Chapman & Hall, London.
110. Jackiewicz Z. (2009) General Linear Methods for Ordinary Differential Equations. JohnWiley & Sons Inc, New York.
111. Jackiewicz Z. and Tracogna S. (1995) A general class of two-step Runge-Kutta methods for ordinary differential equations. SIAM J. Numer. Anal., 32, 1390- 1427.
112. Kahan W. (1965) Further remarks on reducing truncation errors. Comm. ACM, 8, 40.
113. Kirchgraber U. (1986) Multistep methods are essentially one-step methods. Numer. Math., 48, 85-90.
114. Knuth D (1973) The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley.
115. Kuntzmann J. (1961) Neuere Entwickelungen der Methode von Runge-Kutta. Z. Angew. Math. Mech., 41, 28-31.
116. Kutta W. (1901) Beitrag zur näherungsweisen Integration totaler Differentialgleichungen. Z. Math. Phys., 46, 435-453.
117. Lambert J. D. (1991) Numerical Methods for Ordinary Differential Systems: the Initial Value Problem. John Wiley & Sons Ltd, Chichester.
118. Lasagni F. M. (1988) Canonical Runge-Kutta methods. Z. Angew. Math. Phys., 39, 952-953.
119. Lehmer D. H. (1961) A Machine Method for Solving Polynomial Equations. J. ACM, 8, 151-162.
120. López-MarcosM. A., Sanz-Serna J. M. and Skeel R. D. (1996) Cheap enhancement of symplectic integrators. In D. F. Griffiths and G. A. Watson (eds.) Numerical Analysis, Pitman Res. Notes Math. Ser., 344, Longman, Harlow, 107-122.
121. Lotka A. J. (1925) Elements of Physical Biology. Williams and Wilkins, Baltimore, Md.
122. Merson R. H. (1957) An operational method for the study of integration processes. In Proc. Symp. Data Processing,Weapons Research Establishment, Salisbury, S. Australia.
123. Miller J. J. H. (1996) Practical algorithms for finding the type of a polynomial. In Studies in numerical analysis, papers in honour of Cornelius Lanczos on the occasion of his 80th birthday, Academic Press, London, 253-264.
124. Milne W. E. (1926) Numerical integration of ordinary differential equations. Amer. Math. Monthly, 33, 455-460.
125. Milne W. E. (1953) Numerical Solution of Differential Equations. John Wiley & Sons Inc, New York.
126. Moore R. E. (1964) The automatic analysis and control of error in digital computation based on the use of interval numbers. In L. B. Rall (ed.) Error in Digital Computation, vol. 1. JohnWiley & Sons Inc, New York, 61-130.
127. Møller O. (1965a) Quasi double-precision in floating point addition. BIT, 5, 37-50.
128. Møller O. (1965b) Note on quasi double-precision. BIT, 5, 251-255.
129. Moulton F. R. (1926) New Methods in Exterior Ballistics. University of Chicago Press.
130. Muir P. H. and Beame P. W. (1989) A note on error expressions for reflected and averaged implicit Runge-Kutta methods. BIT, 29, 126-139.
131. Nordsieck A. (1962) On numerical integration of ordinary differential equations. Math. Comp., 16, 22-49.
132. Nørsett S. P. (1974) Semi-explicit Runge-Kutta methods, Report No. 6/74, Dept. of Math., Univ. of Trondheim.
133. Norton T. J. T. (2015) Structure-preserving general linear methods, PhD thesis, University of Bath.
134. Norton T. J. T. and Hill A. T. (2015) An iterative starting method to control parasitism for the Leapfrog method. Appl. Numer. Math., 87, 145-156.
135. Nyström E. J. (1925) Über die numerische Integration von Differentialgleichungen. Acta Soc. Sci. Fennicae, 50 (13), 55pp.
136. Obreshkov N. (1940) Neue Quadraturformeln. Abh. der Preuß. Akad. der Wiss., Math.-naturwiss. Klasse, 4, 1-20 .
137. Prothero A. and Robinson A. (1974) On the stability and accuracy of one-step methods for solving stiff systems of ordinary differential equations.Math. Comp., 28, 145-162.
138. Rattenbury N. (2005) Almost Runge-Kuttamethods for stiff and non-stiff problems, PhD thesis, The University of Auckland.
139. Richardson L. F. (1927) The deferred approach to the limit. Philos. Trans. Roy. Soc. London Ser. A., 226, 299-361.
140. Robertson H. H. (1966) The solution of a set of reaction rate equations. In J. Walsh (ed.) Numerical Analysis: An Introduction, Academic Press, London, 178-182.
141. Romberg W. (1955) Vereinfachte numerische Integration. Norske Vid. Selsk. Forh., Trondheim, 28, 30-36.
142. Rosenbrock H. H. (1963) Some general implicit processes for the numerical solution of differential equations. Comput. J., 5, 329-330.
143. Runge C. (1895) Über die numerische Auflösung von Differentialgleichungen. Math. Ann., 46, 167-178.
144. Sanz-Serna J. M. (1988) Runge-Kutta schemes for Hamiltonian systems. BIT, 39, 877-883.
145. Sanz-Serna J. M. and Abia L. (1991) Order conditions for canonical Runge-Kutta schemes. SIAM J. Numer. Anal., 28, 1081-1096.
146. Sanz-Serna J. M. and Calvo M. P. (1994) Numerical Hamiltonian Problems. Chapman & Hall, London.
147. Scherer R. (1977) A note on Radau and Lobatto formulae for ODEs. BIT, 17, 235-238.
148. Scherer R. (1978) Spiegelung von Stabilitätsbereichen. In R. Bulirsch, R. D. Grigorieff and J. Schröder (eds.) Numerical Treatment of Differential Equations, Lecture Notes in Math. 631, Springer, Berlin, 147-152.
149. Singh A. D. (1999) Parallel diagonally implicit multistage integration methods for stiff ordinary differential equations, PhD thesis, The University of Auckland.
150. Söderlind G. (2002) Automatic control and adaptive time-stepping. Numer. Algorithms, 31, 281-310.
151. Stoffer D. (1993) General linear methods: connection to one step methods and invariant curves. Numer. Math., 64, 395-408.
152. Suris Yu. B. (1988) Preservation of symplectic structure in the numerical solution of Hamiltonian systems (in Russian). Akad. Nauk SSSR, Inst. Prikl. Mat., Moscow, 232, 148-160, 238-239.
153. Van der Pol B. (1926) On relaxation-oscillations. Philos. Mag. Ser. 7, 2, 978-992.
154. Verner J. H. (1978) Explicit Runge-Kutta methods with estimates of the local truncation error. SIAM J. Numer. Anal., 15, 772-790.
155. Vitàsek E. (1969) The numerical stability in solution of differential equations. In J.L. Morris (ed.) Conf. on Numerical Solution of Differential Equations, Lecture Notes in Math. 109, Springer, Berlin, 87-111.
156. Volterra V. (1926) Variazioni e fluttuazioni del numero d'individui in specie animali conviventi.Memorie della R. Accad. Naz. dei Lincei, (Ser. VI), 2, 31-131.
157. Wanner G., Hairer E. and Nørsett S. P. (1978) Order stars and stability theorems. BIT, 18, 475-489.
158. Watanabe D. S. and Sheikh Q. M. (1984) One-leg formulas for stiff ordinary differential equations. SIAM J. Sci. Statist. Comput., 2, 489-496.
159. Watts H. A. and Shampine L. F. (1972) A-stable block implicit one-step methods. BIT, 12, 252-266.
160. Wright K. (1970) Some relationships between implicit Runge-Kutta, collocation and Lanczos t methods, and their stability properties. BIT, 10, 217-227.
161. WrightW. M. (2002) Explicit general linear methods with inherent Runge-Kutta stability. Numer. Algorithms, 31, 381-399.
162. Wright W. M. (2003) General linear methods with inherent Runge-Kutta stability, PhD thesis, The University of Auckland.
163. Yoshida H. (1990) Construction of higher order symplectic integrators. Phys. Lett. A, 150, 262-268.