I have a list of n points(2D): P1(x0,y0), P2(x1,y1), P3(x2,y2) …
Points satisfy the condition that each point has unique coordinates and also the coordinates of each point xi, yi> 0 and xi,yi are integers.
The task is to write an algorithm which make approximation of these points
- to the curve
y = | Acos (Bx) |
with the best fit (close or equal to 100%)
- and so that the coefficients A and B were as simple as possible.
I would like to write a program in C # but the biggest problem for me is to find a suitable algorithm. Has anyone would be able to help me with this?
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…