Skip to content

Latest commit

 

History

History
14 lines (9 loc) · 636 Bytes

README.md

File metadata and controls

14 lines (9 loc) · 636 Bytes

Levenberg-Marquardt

Python implementation of Levenberg-Marquardt algorithm built from scratch in Numpy.

In the example, I fit an mechanical hardening law (Hollomon: $σ = K * ε^n$) to noisy generated points:

alt text

scipy.optimize.least_squares works great when you have the raw function for every points (y = ax + b), which is not always the case (ie. black box function or iterative stress compute).

Some references: