泰宁：春节小城过大年 游客体验嗨翻天

百度 其事由原因为，当索尼第一次推出PS3时，开始考虑让新的PS主机不仅仅作为游戏机使用，还提供了安装和运行Linux的能力，这一功能让少数书呆子和当时刚刚起步的加密货币矿工兴奋不已。

The Bogacki–Shampine method is a method for the numerical solution of ordinary differential equations, that was proposed by Przemys?aw Bogacki and Lawrence F. Shampine in 1989 (Bogacki & Shampine 1989). The Bogacki–Shampine method is a Runge–Kutta method of order three with four stages with the First Same As Last (FSAL) property, so that it uses approximately three function evaluations per step. It has an embedded second-order method which can be used to implement adaptive step size. The Bogacki–Shampine method is implemented in the ode3 for fixed step solver and ode23 for a variable step solver function in MATLAB (Shampine & Reichelt 1997).

Low-order methods are more suitable than higher-order methods like the Dormand–Prince method of order five, if only a crude approximation to the solution is required. Bogacki and Shampine argue that their method outperforms other third-order methods with an embedded method of order two.

The Butcher tableau for the Bogacki–Shampine method is:

	0
	1/2	1/2
	3/4	0	3/4
	1	2/9	1/3	4/9
		2/9	1/3	4/9	0
		7/24	1/4	1/3	1/8

Following the standard notation, the differential equation to be solved is $y'=f(t,y)$. Furthermore, $y_{n}$ denotes the numerical solution at time $t_{n}$ and $h_{n}$ is the step size, defined by $h_{n}=t_{n+1}-t_{n}$. Then, one step of the Bogacki–Shampine method is given by:

${\begin{aligned}k_{1}&=f(t_{n},y_{n})\\k_{2}&=f(t_{n}+{\tfrac {1}{2}}h_{n},y_{n}+{\tfrac {1}{2}}h_{n}k_{1})\\k_{3}&=f(t_{n}+{\tfrac {3}{4}}h_{n},y_{n}+{\tfrac {3}{4}}h_{n}k_{2})\\y_{n+1}&=y_{n}+{\tfrac {2}{9}}h_{n}k_{1}+{\tfrac {1}{3}}h_{n}k_{2}+{\tfrac {4}{9}}h_{n}k_{3}\\k_{4}&=f(t_{n}+h_{n},y_{n+1})\\z_{n+1}&=z_{n}+{\tfrac {7}{24}}h_{n}k_{1}+{\tfrac {1}{4}}h_{n}k_{2}+{\tfrac {1}{3}}h_{n}k_{3}+{\tfrac {1}{8}}h_{n}k_{4}.\end{aligned}}$

Here, $z_{n+1}$ is a second-order approximation to the exact solution. The method for calculating $y_{n+1}$ is due to Ralston (1965). On the other hand, $y_{n+1}$ is a third-order approximation, so the difference between $y_{n+1}$ and $z_{n+1}$ can be used to adapt the step size. The FSAL—first same as last—property is that the stage value $k_{4}$ in one step equals $k_{1}$ in the next step; thus, only three function evaluations are needed per step.

References

• Bogacki, Przemys?aw; Shampine, Lawrence F. (1989), "A 3(2) pair of Runge–Kutta formulas", Applied Mathematics Letters, 2 (4): 321–325, doi:10.1016/0893-9659(89)90079-7, ISSN 0893-9659.
• Ralston, Anthony (1965), A First Course in Numerical Analysis, New York: McGraw-Hill.
• Shampine, Lawrence F.; Reichelt, Mark W. (1997), "The Matlab ODE Suite" (PDF), SIAM Journal on Scientific Computing, 18 (1): 1–22, Bibcode:1997SJSC...18....1S, doi:10.1137/S1064827594276424, ISSN 1064-8275, S2CID 14004171.