Given a set of (N + 1) -dimensional real vectors with N independent and 1 dependent value, I would like to calculate a polynomial of degree 1 (linear), 2 (quadratic) or higher, which provides good enough (for example, as determined by a least squares error) ) In other words, when applied to collection elements, a polynomial must match the independent values โโof each of them with the corresponding dependent value (with some reasonable margin of error).
I expect that the dimension of independent variables will be in the range of 2..8 and work with element collections on 20..200. I hope to place the polynomial in milliseconds, not seconds. :-)
I quickly found polynomial regression algorithms for one-dimensional data, but I could not come up with anything practical for multidimensional data. What interests me most is the descriptions of the algorithms or the source code. Any pointers?
source share