So I want to solve the equation z= a + b*y +c*x
,. getting a,b,c
.
ie: making a (plane) surface fit to a load of scatter points in 3D space.
But I can't seem to find anything! I thought there would be a simple module for such a simple problem.
I have tried, where x,y,z are arrays;
ys=zip(x,y)
(coeffs, residuals, rank, sing_vals) = np.linalg.lstsq(ys,z)
am I right in thinking coeffs = b,c? Or am I going completely in the wrong direction. I just can't seem to find anything else that will work in 3d...
I think you're on the right track. You could still try following the example of the scipy.linalg
documentation, in particular the Solving least-squares...` section
A = np.column_stack((np.ones(x.size), x, y))
c, resid,rank,sigma = np.linalg.lstsq(A,zi)
(we added a column of 1 for the constant).
The constants a, b, and c are the unknowns you need to solve for.
If you substitute your N (x, y, z) points into the equation, you'll have N equations for 3 unknowns. You can write that as a matrix:
[x1 y1 1]{ a } { z1 }
[x2 y2 1]{ b } { z2 }
[x3 y3 1]{ c } = { z3 }
...
[xn yn 1] { zn }
Or
Ac = z
where A is an Nx3 matrix, c is a 3x1 vector and z is a 3xN vector.
If you premultiply both sides by the transpose of A, you'll have an equation with a 3x3 matrix that you can solve for the coefficients you want.
Use LU decomposition and forward-back substitution.
来源:https://stackoverflow.com/questions/12617985/fitting-a-linear-surface-with-numpy-least-squares