GenerateChebyshevSecondKindSamplePoints( double a, double b, int numberOfPoints) { return(ChebyshevSecondKindPolynomialInterpolation.GenerateSamplePoints(a, b, numberOfPoints)); }
CreateOnChebyshevSecondKindPoints( double leftBound, double rightBound, IList <double> values) { ChebyshevSecondKindPolynomialInterpolation method = new ChebyshevSecondKindPolynomialInterpolation(); method.Init(leftBound, rightBound, values); return(method); }
/// <summary> /// Create a polynomial interpolation based on chebyshev (second kind) points, that is, "t(i) = 0.5*(b+a) + 0.5*(b-a)*cos(Pi*i/n)". /// </summary> /// <param name="leftBound">The left (smallest) sample point t bound.</param> /// <param name="rightBound">The right (biggest) sample point t bound.</param> /// <param name="values">The sample point values x(t). Supports both lists and arrays.</param> /// <returns> /// An interpolation scheme optimized for the given sample points and values, /// which can then be used to compute interpolations and extrapolations /// on arbitrary points. /// </returns> public static IInterpolationMethod CreateOnChebyshevSecondKindPoints( double leftBound, double rightBound, IList<double> values) { ChebyshevSecondKindPolynomialInterpolation method = new ChebyshevSecondKindPolynomialInterpolation(); method.Init(leftBound, rightBound, values); return method; }