i have this problem, given a series of values [tex] (x_{i} , y_{j} , z_{k}) =U [/tex](adsbygoogle = window.adsbygoogle || []).push({});

could we find a plane [tex] 0=Ax+By+Cz+D [/tex] so the distance from the set of points given in 'U' and the plane with normal vector N=(A,B,C) is a minimum,

or in more general case the distance from the set of points 'U' and the function [tex] 0=g(x,y,z) [/tex] is a minimum , as a certain generalization to the 'least square problem' but in arbitrary dimension

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Multidimensional regresion

**Physics Forums | Science Articles, Homework Help, Discussion**