/*
* EULER S ALGORITHM 5.1
*
* TO APPROXIMATE THE solution OF THE INITIAL VALUE PROBLEM:
* Y = F(T,Y), A<=T<=B, Y(A) = ALPHA,
* AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B].
*
* INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N.
*
* OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T.
*/
標簽：
APPROXIMATE
ALGORITHM
THE
solution
上傳時間：
2015-08-20
上傳用戶：zhangliming420
