Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
4(iii)
PROGRAM NEWTON_RAPHSON_M IMPLICIT NONE REAL::TOL INTEGER::N,I,A REAL, DIMENSION(1000)::X PRINT*,'INPUT A POSITIVE INTEGER:' READ*,A PRINT*,'INPUT THE VALUE OF I AND TOL:' READ*,I,TOL X(1)=9.0 N=1 DO WHILE (N<I) X(N+1)=X(N)*(2.0-A*X(N)) Print*, X(N+1) IF(ABS(X(N+1)-X(N))<TOL)THEN WRITE(*,25)X(N+1) 25 FORMAT('THE SOLUTION IS =',F8.4) STOP END IF N=N+1 END DO END PROGRAM NEWTON_RAPHSON_M
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
A_04 FINITE DIFFERENCE METHOD
s
Q1
Recursive tribonacci
The Sum of the chain (fortran)
A_03 1(I)
A_01 NEWTON_RM(B(III))
problem_4
Q1a
Practice 4 I
Please log in to post a comment.