用递推法产生正交多项式系，即求alpha[j+1]、beta[j] 入口参数：m是数据点数，n是拟合的最高阶数，　　float x[],float y[]是对应纵横坐标，出口参数：a[] 是最小二乘拟合参数，alpha[]、beta[]是递推系数-With recursive orthogonal polynomials law department, that is seeking alpha [j+ 1], beta [j] the entrance of the parameters: m is the data points, n is the number of fitting the most high-end, float x [], float y [ ] is the corresponding vertical and horizontal coordinates, export parameters: a [] is the least-squares fitting parameters, alpha [], beta [] is a recursive coefficient