as I did
thank you
--
View this message in context:
http://mailinglists.scilab.org/automatic-traverse-question-tp4036327p4036383.html
Sent from the Scilab users - Mailing Lists Archives mailing list archive at
Nabble.com.
___
users mailing list
Hello Erhy,
>I studied your solution and think there will be a very huge array with
>kronecker operator and generated the planes with a for loop.
There is a common compromise between the used amount of memory and the
algorithmic speed.
There we are.
>And now I have the problem with the max()
Jumps are generally bad style; I don't know if Scilab even supports
them. If it does I advise you not to use them for something this
trivial (error handling is the only place I've seen them seriously
recommended, and even there they can be very problematical -- it's why
people invented
The Solution is: Using whil:
i = 1
a = 1
while i < 5
disp(i)
a
= a + 1
i = i +1
if a == 3 then
i = i - 1
end
end
Am 2017-05-12
11:15, schrieb Frieder Nikolaisen:
> Hello,
>
> another question to
solve the locomotive stuff, giving you a example with the not implented
code.
>
>
I studied your solution and think there will be a very huge array with
kronecker operator
and generated the planes with a for loop.
And now I have the problem with the max() function for all planes,
at which in the resulting plane each pixel should have the max. values of
the according pixels
Hello,
another question to solve the locomotive stuff, giving you
a example with the not implented code.
I don't want to code the same
stuff twice. Thats why I want to jump between lines of code. Is this
possible and how?
P = 200;
DM = 1;
for n = 1:10
if DM == 1 then
if
P > 100 then
Hello Tim,
Yes. batt is the is the State of Charge of the battery.
P(n,2) (kN) is the power taken rom battery, engine or both. I will
calculate the battery in As, so P(n,2) is only an in alternate value -
but thats fare to complicated for the example code.
"Proving that it's
correct will be
