Block Implicit One-Step Methods
- 1 October 1969
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 23 (108) , 731-740
- https://doi.org/10.2307/2004959
Abstract
A class of one-step methods which obtain a block of new values at each step are studied. The asymptotic behavior of both implicit and predictor-corrector procedures is examined.Keywords
This publication has 7 references indexed in Scilit:
- A Runge-Kutta for all SeasonsSIAM Review, 1967
- Numerical Solution of Initial Value ProblemsMathematics of Computation, 1967
- Stabilizing Predictors for Weakly Unstable CorrectorsMathematics of Computation, 1965
- Relative Stability in the Numerical Solution of Ordinary Differential EquationsSIAM Review, 1965
- Implicit Runge-Kutta ProcessesMathematics of Computation, 1964
- A special stability problem for linear multistep methodsBIT Numerical Mathematics, 1963
- A Method for the Numerical Integration of Ordinary Differential EquationsMathematical Tables and Other Aids to Computation, 1958