~ubuntu-branches/ubuntu/raring/scilab/raring-proposed

« back to all changes in this revision

Viewing changes to modules/signal_processing/help/ja_JP/filters/faurre.xml

  • Committer: Package Import Robot
  • Author(s): Sylvestre Ledru
  • Date: 2012-08-30 14:42:38 UTC
  • mfrom: (1.4.7)
  • Revision ID: package-import@ubuntu.com-20120830144238-c1y2og7dbm7m9nig
Tags: 5.4.0-beta-3-1~exp1
* New upstream release
* Update the scirenderer dep
* Get ride of libjhdf5-java dependency

Show diffs side-by-side

added added

removed removed

Lines of Context:
 
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="ja" xml:id="faurre">
 
3
    <refnamediv>
 
4
        <refname>faurre</refname>
 
5
        <refpurpose>Faurreアルゴリズムによりフィルタの計算</refpurpose>
 
6
    </refnamediv>
 
7
    <refsynopsisdiv>
 
8
        <title>呼び出し手順</title>
 
9
        <synopsis>[P,R,T]=faurre(n,H,F,G,R0)</synopsis>
 
10
    </refsynopsisdiv>
 
11
    <refsection>
 
12
        <title>パラメータ</title>
 
13
        <variablelist>
 
14
            <varlistentry>
 
15
                <term>n</term>
 
16
                <listitem>
 
17
                    <para>反復回数.</para>
 
18
                </listitem>
 
19
            </varlistentry>
 
20
            <varlistentry>
 
21
                <term>H, F, G</term>
 
22
                <listitem>
 
23
                    <para>
 
24
                        <literal>y</literal>系列の共分散から推定.
 
25
                    </para>
 
26
                </listitem>
 
27
            </varlistentry>
 
28
            <varlistentry>
 
29
                <term>R0</term>
 
30
                <listitem>
 
31
                    <para>E(yk*yk')</para>
 
32
                </listitem>
 
33
            </varlistentry>
 
34
            <varlistentry>
 
35
                <term>P</term>
 
36
                <listitem>
 
37
                    <para>n回の反復後のリカッチ方程式の解.</para>
 
38
                </listitem>
 
39
            </varlistentry>
 
40
            <varlistentry>
 
41
                <term>R, T</term>
 
42
                <listitem>
 
43
                    <para>フィルタのゲイン行列.</para>
 
44
                </listitem>
 
45
            </varlistentry>
 
46
        </variablelist>
 
47
    </refsection>
 
48
    <refsection>
 
49
        <title>説明</title>
 
50
        <para>
 
51
            この関数は代数リカッチ方程式の最小解を反復計算により求め,
 
52
            フィルタモデルの行列<literal>R</literal> および <literal>T</literal>を
 
53
            出力します.
 
54
            このアルゴリズムは解Pを以下のような行列Pnの系列の上限値として計算します
 
55
        </para>
 
56
        <programlisting role=""><![CDATA[ 
 
57
                                     -1
 
58
Pn+1=F*Pn*F'+(G-F*Pn*h')*(R0-H*Pn*H')  *(G'-H*Pn*F')
 
59
       -1
 
60
P0=G*R0 *G'
 
61
 ]]></programlisting>
 
62
        <para>
 
63
            この手法は特にFが単位円の近傍に極を有する時に
 
64
            収束しないことに注意してください.
 
65
            この場合には,srfaur関数を使用する方が良いでしょう.
 
66
        </para>
 
67
    </refsection>
 
68
    <refsection role="see also">
 
69
        <title>参照</title>
 
70
        <simplelist type="inline">
 
71
            <member>
 
72
                <link linkend="srfaur">srfaur</link>
 
73
            </member>
 
74
            <member>
 
75
                <link linkend="lindquist">lindquist</link>
 
76
            </member>
 
77
            <member>
 
78
                <link linkend="phc">phc</link>
 
79
            </member>
 
80
        </simplelist>
 
81
    </refsection>
 
82
</refentry>