Jump to content

Kas

Members
  • Posts

    55
  • Joined

  • Last visited

  • Days Won

    1

Posts posted by Kas

  1. Hello asbo. You're right about what you said. Attached is the modified Zip file that includes a published paper from where this algorithm comes from and the "Main.VI" contains some comments where I tried to explain what I'm doing and why.

    Just for referance, the Model Function "Nelder-Mead" VI is correct. I've compared it against some previous script code and the results for chosen values of "n" and "k" were correct. Further more, this worked when I used the "Lev-Mar" fitting method (follow the lonk to the NI forum) but I had to abandon that algorithm since it depends on the gradiant or derivitive of the Model Function. In my case, this is not possible because my model function is based on Discrete values and no derivitive can be precisely found. As such, only the Simplex methodology is the option, where it does not depend on the derivitives.

    Thank you

    Kas

  2. Found the Attached solution. I made it much easier to follow and run the attached VI. However, this simplex method keeps giving me the "maximum Iteration exeeded" error. I choose the initial values quite close to the original.

    One main thing that I am not sure about this algorithm is that how would the algorithm know if the 2 variables are the correct values. On the Lev-Mar algorithm, you have a dependant input of "Y" at which the 2 variables are compared against the f(x) which is Y. but I don't see this input in Simplex algorithm.

    Kas

  3. Hi everyone, can anyone tell me (or illustrate) how to make this simple mathematical calculation WITHOUT using the formula node or any othe scripting language within labview.

    5 to the power of 0.3 or 5^0.3.

    I know that for x^1, 2, 3 etc. i.e. whole No. it could easily be done with a for loop, but I can't think of a way when decimals are involved.

    Help is much appreciated.

    Thanks

    Kas

×
×
  • Create New...

Important Information

By using this site, you agree to our Terms of Use.