ChebyshevSeries<T>.LeastSquaresFit Method

public static ChebyshevSeries<T> LeastSquaresFit(
	Vector<T> xValues,
	Vector<T> yValues,
	int degree
)

Public Shared Function LeastSquaresFit ( 
	xValues As Vector(Of T),
	yValues As Vector(Of T),
	degree As Integer
) As ChebyshevSeries(Of T)

public:
static ChebyshevSeries<T>^ LeastSquaresFit(
	Vector<T>^ xValues, 
	Vector<T>^ yValues, 
	int degree
)

static member LeastSquaresFit : 
        xValues : Vector<'T> * 
        yValues : Vector<'T> * 
        degree : int -> ChebyshevSeries<'T> 

Parameters

xValues  Vector<T>

A vector containing the X-coordinates of the points.

yValues  Vector<T>

A vector containing the Y-coordinates of the points.

degree  Int32

The degree of the least squares polynomial. Must be smaller than the number of data points.

Return Value

The least squares fit of a polynomial through a set of points is the polynomial that minimizes the sum of the squares of the residuals. The residuals are the differences between the predicted and the actual values.

The coordinates of the points are provided in two T arrays. These must have the same number of elements, or an exception is thrown.

In rare cases, the least squares polynomial is a vertical line. In this case, a DivideByZeroException exception is thrown.

public static ChebyshevSeries<T> LeastSquaresFit(
	Vector<T> xValues,
	Vector<T> yValues,
	T lowerBound,
	T upperBound,
	int degree
)

Public Shared Function LeastSquaresFit ( 
	xValues As Vector(Of T),
	yValues As Vector(Of T),
	lowerBound As T,
	upperBound As T,
	degree As Integer
) As ChebyshevSeries(Of T)

public:
static ChebyshevSeries<T>^ LeastSquaresFit(
	Vector<T>^ xValues, 
	Vector<T>^ yValues, 
	T lowerBound, 
	T upperBound, 
	int degree
)

static member LeastSquaresFit : 
        xValues : Vector<'T> * 
        yValues : Vector<'T> * 
        lowerBound : 'T * 
        upperBound : 'T * 
        degree : int -> ChebyshevSeries<'T> 

Parameters

xValues  Vector<T>

A vector containing the X-coordinates of the points.

yValues  Vector<T>

A vector containing the Y-coordinates of the points.

lowerBound  T

The lower bound of the interval.

upperBound  T

The upper bound of the interval.

degree  Int32

The degree of the least squares polynomial. Must be smaller than the number of data points.

Return Value

The least squares fit of a polynomial through a set of points is the polynomial that minimizes the sum of the squares of the residuals. The residuals are the differences between the predicted and the actual values.

The coordinates of the points are provided in two T arrays. These must have the same number of elements, or an exception is thrown.

In rare cases, the least squares polynomial is a vertical line. In this case, a DivideByZeroException exception is thrown.

Reference