@Norbert. It is a modification. I´ve already modified the two mentioned algorithms (optimization of a vortex lattice method). But in order to complete the modification,
I need to create a iterative procedure or rather a loop running as long as my convergence criterion isn´t archieved -.- ( and I...
You are right, but I can´t split the program into more subroutines because this hole existing code is a big mess. I am also far away from good enough in programming to figure that out...if I split it up even more, I will have the risk, that the assignment for other variables won´t work any...
Sure, do/while loops would have been the best way possible…but
+as there are about 3000 lines existing program code between the two algorithms
+each algorithm is in another subroutine,
… I was unable to fit loop in the program structure. In fact I haven´t been able to jump from the second...
That is what I´ve tried so far..
..
..
900 continue
if(jump .eq. 0)jump = 1
..
..
..
if(jump .eq. 1) go to 901
jump = 0 go to 900
901 continue
..
Still got an building failure.
Hi everyone,
at a certain point in my code I would like to jump backwards to the beginning of my code, in order to carry out a new run
with the before calculated value. So far I´ve tried to use a "go to "marker"" order and placed the marker where I would like to
start again. However that...
The open statement and iread is done in another module and is working well....
The code above is just a short excerpt from a larger program code Iam using and the new values are supposed to improve the optimization and to minimize inaccuracy!
Since this is the first time working with fortran I...
Hi everyone,
i got a similar problem with f95... I have some trouble adapting an existing fortran code for my application.
In the following Module I am optimizing a value for two planes ( i = iplan one&two).
In order to do that, I need to assign ten certain values from an external inp. file...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.