An efficient family of strongly A-stable Runge-Kutta collocation methods for stiff systems and DAEs. Part II: Convergence results

Authors:
S. GonzáLez-Pinto;D. HernáNdez-Abreu;J. I. Montijano
Affiliations:
Departamento de Análisis Matemático, Universidad de La Laguna, 38071, La Laguna, Spain;Departamento de Análisis Matemático, Universidad de La Laguna, 38071, La Laguna, Spain;IUMA-Departamento de Matemática Aplicada, Universidad de Zaragoza, 50009, Zaragoza, Spain
Venue:
Applied Numerical Mathematics
Year:
2012

Citing 8
Cited 2

B-convergence of the implicit midpoint rule and the trapezoidal rule

BIT
A study of B-convergence of Runge-Kutta methods

Computing
The order of B-convergence of the Gaussian Runge-Kutta method

Computing
Stability of implicit Runge-Kutta methods for nonlinear stiff differential equations

BIT
On symmetric Runge-Kutta methods of high order

Computing
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems

Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Structure Preservation for Constrained Dynamics with Super Partitioned Additive Runge--Kutta Methods

SIAM Journal on Scientific Computing
An efficient family of strongly A-stable Runge-Kutta collocation methods for stiff systems and DAEs. Part I: Stability and order results

Journal of Computational and Applied Mathematics

Strongly A-stable first stage explicit collocation methods with stepsize control for stiff and differential-algebraic equations

Journal of Computational and Applied Mathematics
Adaptive ODE solvers in extended Kalman filtering algorithms

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The convergence properties of a newly defined uniparametric family of collocation Runge-Kutta methods on non-stiff systems, stiff semi-linear problems and Differential-Algebraic Equations are analysed. For each s=3, the so-called family of SAFERK methods is based on interpolatory quadrature rules of order 2s-3, and they have the same number of implicit stages as the s-stage LobattoIIIA and (s-1)-stage RadauIIA methods. Since s-stage SAFERK methods possess the same algebraic order as the (s-1)-stage RadauIIA method, the corresponding principal terms of local error are compared, and it is shown that those SAFERK methods with positive weights and nodes located in the integration interval possess, in the l"2-norm, a smaller principal term of local error. Moreover, it is proved that SAFERK methods are convergent when integrating relevant classes of stiff problems and Differential-Algebraic Equations. In particular, they possess a higher stiff order than the RadauIIA method of the same algebraic order, due to a higher stage order of the new methods. On the other hand, because of the strong A-stability, SAFERK methods can be competitive with LobattoIIIA methods, particularly for stiff problems on large time intervals.