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 disc
Efficient higher order implicit one-step methods for integration of stiff differential equations
β Scribed by W. M. G. van Bokhoven
- Publisher
- Springer Netherlands
- Year
- 1980
- Tongue
- English
- Weight
- 415 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0006-3835
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
When the s-stage fully implicit Runge}Kutta (RK) method is used to solve a system of n ordinary di!erential equations (ODE) the resulting algebraic system has a dimension ns. Its solution by Gauss elimination is expensive and requires 2sn/3 operations. In this paper we present an e$cient algorithm,
The identification of high order diagonally implicit multistage integration methods with appropriate stability properties requires the solution of high dimensional nonlinear equation systems. The approach to the solution of these equations, and hence the construction of suitable methods, that we wil