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" xmlns:scilab="http://www.scilab.org" xml:lang="en" xml:id="chepol">
3     <refnamediv>
4         <refname>chepol</refname>
5         <refpurpose>Chebychev polynomial</refpurpose>
6     </refnamediv>
7     <refsynopsisdiv>
8         <title>Calling Sequence</title>
9         <synopsis>[Tn]=chepol(n,var)</synopsis>
10     </refsynopsisdiv>
11     <refsection>
12         <title>Arguments</title>
13         <variablelist>
14             <varlistentry>
15                 <term>n</term>
16                 <listitem>
17                     <para>integer : polynomial order</para>
18                 </listitem>
19             </varlistentry>
20             <varlistentry>
21                 <term>var</term>
22                 <listitem>
23                     <para>string : polynomial variable</para>
24                 </listitem>
25             </varlistentry>
26             <varlistentry>
27                 <term>Tn</term>
28                 <listitem>
29                     <para>
30                         polynomial in the variable <literal>var</literal>
31                     </para>
32                 </listitem>
33             </varlistentry>
34         </variablelist>
35     </refsection>
36     <refsection>
37         <title>Description</title>
38         <para>
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>.
42         </para>
43     </refsection>
44     <refsection>
45         <title>Examples</title>
46         <programlisting role="example"><![CDATA[
47 chepol(4,'x')
48  ]]></programlisting>
49     </refsection>
50 </refentry>