论文信息 - Contractivity preserving explicit linear multistep methods

Contractivity preserving explicit linear multistep methods

SummaryWe investigate contractivity properties of explicit linear multistep methods in the numerical solution of ordinary differential equations. The emphasis is on the general test-equation $$\frac{d}{{dt}}U(t) = AU(t)$$ , whereA is a square matrix of arbitrary orders≧1. The contractivity is analysed with respect to arbitrary norms in thes-dimensional space (which are not necessarily generated by an inner product). For given order and stepnumber we construct optimal multistep methods allowing the use of a maximal stepsize.

H. Lenferink | H. W. Lenferink

[1] J. Kraaijevanger,et al. Absolute monotonicity of polynomials occurring in the numerical solution of initial value problems , 1986 .

[2] C. Bolley,et al. Conservation de la positivité lors de la discrétisation des problèmes d'évolution paraboliques , 1978 .

[3] I. Gladwell,et al. Analysis of explicit difference methods for a diffusion‐convection equation , 1978 .

[4] F. Gantmacher,et al. Applications of the theory of matrices , 1960 .

[5] P. Henrici. Discrete Variable Methods in Ordinary Differential Equations , 1962 .

[6] Werner Liniger,et al. Contractive methods for stiff differential equations Part II , 1978 .

[7] J. Kraaijevanger,et al. Absolute monotonicity of rational functions occurring in the numerical solution of initial value problems , 1986 .

[8] Reiner Vanselow,et al. Nonlinear stability behaviour of linear multistep methods , 1983 .

[9] Jörgen Sand. Circle contractive linear multistep methods , 1986 .

[10] M. N. Spijker. Contractivity in the numerical solution of initial value problems , 1983 .

[11] O. Nevanlinna,et al. Stability of explicit time discretizations for solving initial value problems , 1982 .

[12] J. Lambert. Computational Methods in Ordinary Differential Equations , 1973 .