Results 221 to 230 of about 64,667 (273)

Linear Multistep Methods as Irreducible General Linear Methods

BIT Numerical Mathematics, 2006
This paper is concerned with the topic of stability for linear multistep methods (LMM's) in relation with associated general linear methods (GLM's). The authors show how to write an LMM as a GLM and prove that if an LMM is irreducible then the corresponding GLM also is, improving in this way a procedure given by \textit{K. Burrage} and \textit{J.
Butcher, J. C., Hill, A. T.
openaire   +4 more sources

Auxiliary linear multistep methods: explicit

International Journal of Computer Mathematics, 1989
A class of high order explicit 2-step methods for the integration of ordinary differential equations have been developed. The methods use the slopes at several auxiliary points within a step. The efficiency of the methods has been established by comparing numerical results with those of Adams—Bashforth—Moulton predictor-corrector method and Runge-Kutta
G. Sahoo, N. Datta
openaire   +1 more source

On convergent linear multistep matrix methods

International Journal of Computer Mathematics, 1991
In this paper a sufficient condition in order to a linear multistep matrix method for computing numerically initial value differential matrix problems be convergent is given.
Lucas Jódar, J. L. Morera, E. Navarro
openaire   +1 more source

Multirate linear multistep methods

BIT, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gear, C. W., Wells, D. R.
openaire   +2 more sources

Instability in linear multistep methods

Applicable Analysis, 1988
Classes of multistep methods with k steps, order k+1 and depending on a certain number of free parameters, one of them representing the size of the real interval of stability are constructed. A criterion to select automatically multistep methods of such classes, which are fitted with the eigenvalues of the jacobian matrix of a differential system is ...
Paula Oliveira, Fernanda Patricio
openaire   +1 more source

Error Estimate for a Linear Multistep Method

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1991
For the system \(x=Tx+b\) of linear equations in a Banach space with \(T=T_ 0+...+T_ n\), \(n\geq 1\), we consider the implicit stationary n- step method \(x_{k+n}=\sum^{n}_{i=0}T_ ix_{k+n-i}+b,\) \(k=0,1,2,...\). In case of \(\| T\|
openaire   +2 more sources

Multistep Methods and General Linear Methods

1987
This chapter is devoted to the study of multistep and general multivalue methods. After retracing their historical developement (Adams, Nystrom, Milne, BDF) we study in the subsequent sections the order, stability and convergence properties of these methods.
Ernst Hairer   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy