In this paper, variable stepsize multistep methods for higher-order delay differential equations of the type y(')(t) = f(t,y(t),y(t -r)) are proposed. Explicit error bounds for the global discretization error are given. It is proved that a variable multistep method which is a perturbation of strongl
Higher order implicit multistep methods for matrix differential equations
✍ Scribed by J.L. Morera; G. Rubio; L. Jódar
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 510 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
✦ Synopsis
This paper proposes implicit multistep matrix methods for the numerical solution of stiff initial value matrix problems. The study of matrix difference equations involving the matrix coefficients of the multistep method permits one to obtain convergence results, as well as bounds for the global discretization error in terms of the data. An illustrative example is included.
📜 SIMILAR VOLUMES
this paper, variable stepsize multistep methods for delay differential equations of the type y(t) = f(t,?l(t),y(t -r)) are proposed. Error bounds for the global discretization error of variable stepsize multistep methods for delay differential equations are explicitly computed. It is proved that a
We approximate the solution of initial boundary value problems for equations of the form Au'(t) =: B(t, u(t)), t E [0, t\*]. A is a linear, selfadjoint, positive definite operator on a Hilbert space (H, (-, .)) and B is a possibly nonlinear operator. We discretize in space by finite element methods
In this paper, we propose a new discontinuous finite element method to solve initial value problems for ordinary differential equations and prove that the finite element solution exhibits an optimal O(Dt p+1 ) convergence rate in the L 2 norm. We further show that the p-degree discontinuous solution