Hello......
I have wrote before that:
"I have first implemented a solver for my USL program that
is polynomial regression, this solver must make
the a0 coefficient of the mathematical serie to 0, but this solver
is not so efficient as my other solver that i have implemented
that is nonlinear regression using the simplex method of
of Nelder and Mead as a function minimization, this nonlinear
solver that i have implemented works perfectly and is more
efficient than the solver that uses polynomial regression"
Also in my USL programs i have calculated and feed my nonlinear solver
with partial derivates of the USL equation:
C(N) = N/(1 + α (N − 1) + β N (N − 1))
I have calculated the partial derivative with respect to
α of the above USL equation, and i have calculated the partial
derivative with respect to β of the above USL equation, and the
two partial derivatives must be given to my nonlinear solver
that uses the simplex method of of Nelder and Mead as a function
minimization.
Please try my USL programs because they are working great and
they predict scalability !
I have included the 32 bit and 64 bit windows executables of my
programs inside the zip file to easy the job for you.
You can download my USL programs version 3.0 with the source code from:
https://sites.google.com/site/aminer68/universal-scalability-law-for-delphi-and-freepascal
Thank you,
Amine Moulay Ramdane.
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)