Introduction to numerical analysis: 2nd edition
Introduction to numerical analysis: 2nd edition
Efficiency of Predictor-Corrector Procedures
Journal of the ACM (JACM)
A Modified Multistep Method for the Numerical Integration of Ordinary Differential Equations
Journal of the ACM (JACM)
A Multistep Generalization of Runge-Kutta Methods With Four or Five Stages
Journal of the ACM (JACM)
Multistep Methods With Modified Predictors and Correctors
Journal of the ACM (JACM)
Solution of Ordinary Differential Equations Using Two ``Off-Step'' Points
Journal of the ACM (JACM)
A Modification of Nordsieck's Method Using an ``Off-Step'' Point
Journal of the ACM (JACM)
Generalized Multistep Methods in Satellite Orbit Computation
Journal of the ACM (JACM)
A-Stable Composite Multistep Methods
Journal of the ACM (JACM)
A comparative study of computer programs for integrating differential equations
Communications of the ACM
Methods of numerical integration applied to a system having trivial function evaluations
Communications of the ACM
Cyclic composite multistep predictor-corrector methods
ACM '69 Proceedings of the 1969 24th national conference
Further results on generalized predictor-corrector methods
Journal of Computer and System Sciences
Optimal Explicit Strong-Stability-Preserving General Linear Methods
SIAM Journal on Scientific Computing
A learning program for the integration of systems of ordinary differential equations
Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium
Extrapolated Multirate Methods for Differential Equations with Multiple Time Scales
Journal of Scientific Computing
Multiphysics simulations: Challenges and opportunities
International Journal of High Performance Computing Applications
Hi-index | 0.04 |
The order p which is obtainable with a stable k-step method in the numerical solution of y′ = f(x, y) is limited to p = k + 1 by the theorems of Dahlquist. In the present paper the customary schemes are modified by including the value of the derivative at one “nonstep point;” as usual, this value is gained from an explicit predictor. It is shown that the order of these generalized predictor-corrector methods is not subject to the above restrictions; stable k-step schemes with p = 2k + 2 have been constructed for k ≤ 4. Furthermore it is proved that methods of order p actually converge like hp uniformly in a given interval of integration. Numerical examples give some first evidence of the power of the new methods.