1
<?xml version="1.0" encoding="UTF-8"?>
2
<refentry xmlns="http://docbook.org/ns/docbook" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:svg="http://www.w3.org/2000/svg" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:db="http://docbook.org/ns/docbook" version="5.0-subset Scilab" xml:lang="en" xml:id="chepol">
4
<refname>chepol</refname>
5
<refpurpose> Chebychev polynomial</refpurpose>
8
<title>Calling Sequence</title>
9
<synopsis>[Tn]=chepol(n,var)</synopsis>
12
<title>Arguments</title>
17
<para>integer : polynomial order</para>
23
<para>string : polynomial variable</para>
30
polynomial in the variable <literal>var</literal>
37
<title>Description</title>
39
Recursive implementation of Chebychev polynomial.
40
<literal>Tn=2*poly(0,var)*chepol(n-1,var)-chepol(n-2,var)</literal> with
41
<literal>T0=1</literal> and <literal>T1=poly(0,var)</literal>.
45
<title>Examples</title>
46
<programlisting role="example"><![CDATA[