sort the terms in a Chebyshev series
expression assumed to be a Chebyshev series
The input expression e is assumed to be a polynomial expressed in terms of a Chebyshev basis T⁡0,x,....
First the expression e is collected in 'T'. Then the terms in the collected polynomial expression are sorted in ``Chebyshev order''; i.e. the T⁡k,x basis polynomials are ordered in ascending order with respect to the first argument.
If some basis polynomials T⁡k,x have non-numeric first argument then ordering will be attempted using the ``is'' predicate. If that is not successful then ordering is performed only with respect to numeric first arguments (other terms are left as trailing terms).
Note that chebsort is a destructive operation because it invokes the Maple sort function (see sort); i.e. the input expression is sorted ``in-place''.
The command with(numapprox,chebsort) allows the use of the abbreviated form of this command.
Digits ≔ 3:
a ≔ chebyshev⁡sin⁡x,x:
b ≔ chebyshev⁡cos⁡x,x:
c ≔ a+b
d ≔ 1.2⁢y+cj⁢T⁡j,x+a+ck⁢T⁡k,x
Download Help Document