A study of B-convergence of Runge-Kutta methods. (English) Zbl 0572.65053
This paper deals with the convergence analysis of implicit Runge-Kutta methods as applied to stiff, semilinear systems of the form \(\dot U(\)t)\(=QU(t)+g(t,U(t))\). A criterion is developed which determines whether the order of optimal B-convergence is at least equal to the stage order or one order higher. This criterion is studied for a number of interesting classes of methods.
MSC:
| 65L05 | Numerical methods for initial value problems involving ordinary differential equations |
References:
| [1] | Burrage, K.: Stability and efficiency properties of implicit Runge-Kutta methods. Ph. D. Thesis, Dept. of Math., Univ. of Auckland, 1978. · Zbl 0388.65036 |
| [2] | Burrage, K.: A special family of Runge-Kutta methods for solving stiff differential equations. BIT18, 22–41 (1978). · Zbl 0384.65034 · doi:10.1007/BF01947741 |
| [3] | Butcher, J. C.: OnA-stable implicit Runge-Kutta methods. BIT17, 375–378 (1977). · Zbl 0378.65039 · doi:10.1007/BF01933446 |
| [4] | Crouzeix, M., Raviart, P. A.: Méthodes de Runge-Kutta. Unpublished lecture notes. Université de Rennes, 1980. |
| [5] | Dekker, K., Kraaijevanger, J. F. B. M., Spijker, M. N.: The order ofB-convergence of the Gaussian Runge-Kutta method. Computing (this issue). · Zbl 0565.65040 |
| [6] | Dekker, K., Verwer, J. G.: Stability of Runge-Kutta methods for stiff nonlinear differential equations. Amsterdam: North-Holland 1984. · Zbl 0571.65057 |
| [7] | Frank, R., Schneid, J., Ueberhuber, C. W.: The concept ofB-convergence. SIAM J. Numer. Anal.18, 753–780 (1981). · Zbl 0467.65032 · doi:10.1137/0718051 |
| [8] | Frank, R., Schneid, J., Ueberhuber, C. W.: Stability properties of implicit Runge-Kutta methods. SIAM J. Numer. Anal.22, 497–514 (1985). · Zbl 0577.65055 · doi:10.1137/0722030 |
| [9] | Frank, R., Schneid, J., Ueberhuber, C. W.: Order results for implicit Runge-Kutta methods applied to stiff systems. SIAM J. Numer. Anal.22, 515–534 (1985). · Zbl 0577.65056 · doi:10.1137/0722031 |
| [10] | Hairer, E., Bader, G., Lubich, Ch.: On the stability of semi-implicit methods for ordinary differential equations. BIT22, 211–232 (1982). · Zbl 0489.65046 · doi:10.1007/BF01944478 |
| [11] | Hundsdorfer, W. H.: The numerical solution of nonlinear stiffinitial value problems – an analysis of one-step methods. CWI Tract 12, Amsterdam 1985. · Zbl 0557.65048 |
| [12] | Hundsdorfer, W. H., Spijker, M. N.: On the algebraic equations in implicit Runge-Kutta methods. SIAM J. Numerical Anal. (to appear). · Zbl 0636.65066 |
| [13] | Kraaijevanger, J. F. B. M.:B-convergence of the implicit midpoint rule and the trapezoidal rule. BIT (to appear). · Zbl 0584.65048 |
| [14] | Nørsett, S. P.: Semi-explicit Runge-Kutta methods. Report Math. and Comp. No. 6/74, Dept. of Math., Univ. of Trondheim, 1974. · Zbl 0278.65078 |
| [15] | Nørsett, S. P.:C-polynomials for rational approximations to the exponential function. Numer. Math.25, 39–56 (1975). · Zbl 0299.65010 · doi:10.1007/BF01419527 |
| [16] | Prothero, A., Robinson, A.: On the stability and accuracy of one-step methods for solving stiff systems of ordinary differential equations. Math. Comp.28, 145–162 (1974). · Zbl 0309.65034 · doi:10.1090/S0025-5718-1974-0331793-2 |
| [17] | Stetter, H. J.: ZurB-Konvergenz der impliziten Trapez- und Mittelpunktregel, unpublished note. |
| [18] | Verwer, J. G.: Convergence and order reduction of diagonally implicit Runge-Kutta schemes in the method of lines. Proc. Dundee 1985, D. F. Griffiths (ed.), Pitman Publ. Co. (to appear). · Zbl 0642.65066 |
| [19] | Wanner, G., Hairer, E., Nørsett, S. P.: Order stars and stability theorems. BIT18, 475–489 (1978). · Zbl 0444.65039 · doi:10.1007/BF01932026 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
