ADAMS-FOURTH ALGORITHM
2016-08-23
0 0 0
no vote
Other
Earn points
TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROLEM:
Y'=F(T,Y), A<=T<=B, Y(A)=ALPHA,
AT (N+1) EQUALLY SPACED NUMBERS 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.
T(1),...,T(4) AND W(1),...,W(4) ARE THE 4 MOST RECENT VALUES OF
T(I) AND W(I) RESP.
Y'=F(T,Y), A<=T<=B, Y(A)=ALPHA,
AT (N+1) EQUALLY SPACED NUMBERS 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.
T(1),...,T(4) AND W(1),...,W(4) ARE THE 4 MOST RECENT VALUES OF
T(I) AND W(I) RESP.
fortran
算法
Related Source Codes
Deform secondary development
0
0
no vote
Classic Interview Questions for Digital City Front
0
0
no vote
HDU-2553 N Queen Question
0
0
no vote
unifiber-VUMAT
0
0
no vote
Artificial fish school algorithm
0
0
no vote
No comment