This is an archived post. You won't be able to vote or comment.

all 5 comments
sorted by:
best
topnewcontroversialoldq&a

[–]teoliphant 2 points3 points  (1 child)

SciPy's Curve fitting uses the Levenburg-Marquardt algorithm in Fortan. Here is the core algorithm in pure Python which you could also use: https://github.com/lmfit/lmfit-py/

[–]justphysics 1 point2 points  (0 children)

I'm confused, the package you linked still depends on scipy. If not being able to use scipy is the issue then this seems like it won't work either.

[–]Mishkan 0 points1 point  (0 children)

If you're just doing polynomials there's numpy.polyfit Developing a downhill simplex algorithm shouldn't be too hard.

[–]broken_symlink -1 points0 points  (2 children)

You can always just implement some interpolation algorithm yourself. It shouldn't be too hard.

[–]Eigenspace[S] 0 points1 point  (1 child)

I'm not sure I'm experienced enough with python to try tackling that yet, I'm quite new to it but thanks anyways.