On a Multistep Method II
スポンサーリンク
概要
- 論文の詳細を見る
In the paper [2], we introduced a multistep method for solving the initial value problem : y' = f(x, y), y(x_0) = y_0, stepsize=h, (0.1) using the idea of quadrature formulas as in [1], for the corrector we use the later part of the formulas, which Prof. W. D. Milne used for the corrector of the starting values. But, we did not show the algorithm to solve (0.1). So, we want to show that in detail. Next, we renew the predictor for the sake of the accuracy.
- 九州産業大学の論文
- 1995-03-00
著者
関連論文
- On the Transformation to Get only Simple Real Zeros for an Algebraic Equation with Complex Zoros or Multiple Real Zoros
- A Chebyshev-Type Quadrature for 8 and 10 through 17 Nodes
- On the Transformation of the Algebratic Equations to those with only Simple Real Roots
- On A Chebyshev-Type Quadrature For Twelve Nodes
- On A Chebyshev-Type Quadrature for 18 Nodes
- On a Two-Stage Runge-Kutta Method
- On the Three-Stage Runge-Kutta Method II
- On the Four-Stage Runge-Kutta Method II
- ON THE RELATIVE STABILITY OF A SIX-POINT MULTISTEP METHOD
- On the Stability of a Six-Point Multistep Method
- On the Three-Stage Runge-Kutta Method
- THE CORECTION REGARDING "ON THE STABILITY OF A SEVEN-POINT MULTISTEP METHOD"
- On the Stability of a Seven-Point Multistep Method
- On a Multistep Method II
- ON A MULTISTEP METHOD
- ON THE STABILITY OF A FIVE-POINT MULTISTEP METHOD