Calvo, M., Montijano, J. I. and R'andez, L. "On the change of stepsizes in multistep codes." Numerical Algorithms 4 pp283-304 (1993). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Experiments in stepsize control for Adams linear multistep methods - Willé (2000) (Correct)
....of suitable orders and stepsizes is non trivial and has been the subject of much research. Given suitable methods to compute and advance the integration formulae, it can make the difference between a good and a bad code. A number of different approaches have been suggested for this problem [1, 2, 4, 5, 8, 9, 10, 11]. This work concentrates on and extends two of these: one implemented by Shampine in his code RDEAM [11] and a second, simpler, version based on the difference between a predictor and corrector formula. Communicated by Prof. C. T. H. Baker, this document originally appeared as an IWR preprint ....
....should acknowledge this. We hope to present a more detailed examination of this subject in a later paper. Recent research suggests that startup strategies may be one of the key factors Consider as starting order sequence of k = 1; 2; 3; 14 in efficient code design [5] Other workers [2, 9] are active also in this field. 12 Relation to other methods It should be noted that this work differs fundamentally from more conventional schemes using trial steps or Runge Kutta formulae to estimate appropriate stepsizes. Instead of making potentially expensive function evaluations to sample ....
[Article contains additional citation context not shown here]
Calvo, M., Montijano, J. I. and R'andez, L. "On the change of stepsizes in multistep codes." Numerical Algorithms 4 pp283-304 (1993).
Experiments in stepsize control for Adams linear multistep methods - Wille (1994) (Correct)
....of suitable orders and stepsizes is non trivial and has been the subject of much research. Given suitable methods to compute and advance the integration formulae, it can make the difference between a good and a bad code. A number of different approaches have been suggested for this problem [1, 2, 4, 5, 8, 9, 10, 11]. This work concentrates on and extends two of these: one implemented by Shampine in his code RDEAM [11] and a second, simpler, version based on the difference between a predictor and corrector formula. Communicated by Prof. C. T. H. Baker, this document originally appeared as an IWR preprint ....
....should acknowledge this. We hope to present a more detailed examination of this subject in a later paper. Recent research suggests that startup strategies may be one of the key factors 8 Consider as starting order sequence of k = 1; 2; 3; in efficient code design [5] Other workers [2, 9] are active also in this field. 12 Relation to other methods It should be noted that this work differs fundamentally from more conventional schemes using trial steps or Runge Kutta formulae to estimate appropriate stepsizes. Instead of making potentially expensive function evaluations to sample ....
[Article contains additional citation context not shown here]
Calvo, M., Montijano, J. I. and R'andez, L. "On the change of stepsizes in multistep codes." Numerical Algorithms 4 pp283-304 (1993).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC