Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
A_03 EULER'S METHOD
PROGRAM EM IMPLICIT NONE REAL::T,Y,Z,H,F,DY INTEGER::I,N,INT PRINT*,'ENTER THE VALUE OF T:' READ*,T PRINT*,'ENTER THE VALUE OF Y:' READ*,Y PRINT*,'ENTER THE VALUE OF Y(T):' READ*,Z PRINT*,'ENTER THE VALUE OF STEP SIZE :' READ*,H N=INT((Z-T)/H) DO I = 1,N DY=F(T,Y)*H T=T+H Y=Y+DY PRINT*, I ,T ,Y END DO PRINT*,'VALUE OF Y AT T:',Y END PROGRAM EM REAL FUNCTION F(T,Y) REAL::T,Y F=T**2.0-T*Y+Y**2.0 END FUNCTION F
run
|
edit
|
history
|
help
0
Chebyshev practice
Hello / fortran
my_second_code
1(iii)
Recursive tribonacci
Vi ss. F
222
Adams-Bashforth Method for four step
finitos
first