EULER'S ALGORITHM
2016-08-23
0 0 0
no vote
Other
Earn points
O 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.
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.
fortran
Related Source Codes
Deform secondary development
0
0
no vote
unifiber-VUMAT
0
0
no vote
3D Hashin failure criterion subroutine, Umat, for
0
0
no vote
Godunov scheme for solving one-dimensional shallow
0
0
no vote
Riemann-Solver
0
0
no vote
No comment