public static Polynom operator |(Polynom p, int k)//производная полинома { if (k >= p.degree + 1) { return(Polynom.ToPolynom(0)); } if (k == 0) { return(p); } double[] d = new double[(int)p.degree - k + 1]; if (k > 0) { for (int i = 0; i < d.Length; i++) { d[i] = p.coef[k + i] * Combinatorik.A(i, k + i); } } else { for (int i = 0; i < p.coef.Length; i++) { d[-k + i] = p.coef[i] / Combinatorik.A(i, -k + i); } } return(new Polynom(d)); }
/// <summary> /// Полиномы Эрмита для набора кратных узлов /// </summary> /// <param name="mas"></param> /// <returns></returns> public static Polynom Hermit(params MultipleKnot[] mas) { int n = -1;//dergee of Pol for (int i = 0; i < mas.Length; i++) { n += mas[i].Multiplicity; } SLAU S = new SLAU(n + 1);//S.Show(); int k = 0; for (int i = 0; i < mas.Length; i++) { for (int j = 0; j < mas[i].Multiplicity; j++) { S.b[k + j] = mas[i].y[j]; for (int t = 0; t <= n - j; t++) { int s = n - j - t; S.A[k + j, t] = Combinatorik.A(s, j + s) * Math.Pow(mas[i].x, s); } } k += mas[i].Multiplicity; } S.GaussSelection(); //S.Show(); Array.Reverse(S.x); return(new Polynom(S.x)); }