OrthonormalizationAlgorithm¶

class OrthonormalizationAlgorithm(*args)¶

Algorithm used to build the orthonormal basis.

With respect to a specific distribution.

Available constructors:

OrthonormalizationAlgorithm(orthoAlgoImp)

OrthonormalizationAlgorithm(measure)

Parameters

orthoAlgoImpOrthonormalizationAlgorithmImplementation: An orthonormalization algorithm implementation.
measureDistribution: A distribution for which the orthonormal polynomial basis is built.

See also

AdaptiveStieltjesAlgorithm

Notes

It enables to build the orthonormal polynomial basis with respect to the given distribution.

In the first usage, the algorithm orthoAlgoImp is used (that specifies the associated distribution). In the second usage, the Gram-Schmidt algorithm is used by default. Only the distribution measure is specified.

Methods

`getClassName`(self)	Accessor to the object’s name.
`getId`(self)	Accessor to the object’s id.
`getImplementation`(self)	Accessor to the underlying implementation.
`getMeasure`(self)	Accessor to the measure.
`getName`(self)	Accessor to the object’s name.
`getRecurrenceCoefficients`(self, n)	Accessor to the recurrence coefficients.
`setMeasure`(self, measure)	Accessor to the measure.
`setName`(self, name)	Accessor to the object’s name.

__init__(self, \*args)¶: Initialize self. See help(type(self)) for accurate signature.

getClassName(self)¶

Accessor to the object’s name.

Returns

class_namestr: The object class name (object.__class__.__name__).

getId(self)¶

Accessor to the object’s id.

Returns

idint: Internal unique identifier.

getImplementation(self)¶

Accessor to the underlying implementation.

Returns

implImplementation: The implementation class.

getMeasure(self)¶

Accessor to the measure.

Returns

mDistribution: The measure for which the orthonormal polynomial basis is built.

getName(self)¶

Accessor to the object’s name.

Returns

namestr: The name of the object.

getRecurrenceCoefficients(self, n)¶

Accessor to the recurrence coefficients.

Parameters

ninteger: Index ot the recurrence step.

Returns

coefsequence of float: Calculate the coefficients of recurrence $a_0$ , $a_1$ , $a_2$ such that $P_{n+1}(x) = (a_0 \times x + a_1) \times P_n(x) + a_2 \times P_{n-1}(x)$ .