Least Squares (X,Y) point for 2D Intersection of Lines

[SeanDonner]

I have 6 line equations (Y=mx + b) that do not intersect at the same point.  Is there any pre-written LabVIEW code that will take the line coefficients and find me the closest intersection (x,y) point using least-squares fit?

[GerdW · Accepted solution]

Hi Sean,

this sounds like a rather simple (because of just 6 first order polynomials) algebra problem: there is a full "Linear Algebra" functions palette…

[SeanDonner]

Thanks for the pointer to the "Linear Algebra" palette, inside there is a "Solve Linear Equations" VI and in the context help says "When m > n, the system has more equations than unknowns, so it is an over-determined system. Since the solution that satisfies AX = Y may not exist, the VI finds the least-square solution X, which minimizes ||AX – Y||."

I didn't have to do a thing other than build up the matrix and column vectors A and Y, respectively.

Thanks!