Closed - This job posting has been filled and work has been completed.
Am struggling a bit with trying to implement an algorithm from Numerical Recipes in C.
Given a set of points that produce a nice gentle 2nd degree polynomial curve, I want to find a,b and c such that y = ax^2 = bx + c.
Have tried using svdfit but am getting a :no convergence in 30 svdcmp iterations, so perhaps I am doing something wrong. Another alternative would be lfit.
Here is some sample data to test your program on.
Solution must be in ANSI C and be well commented with explanations on use.
Happy for you to simply get the NR algorithm to work and explain how you did it.
Skills: algorithms, producer, test