Also update the URL to the CeCILL license. Thanks to Paul for noticing that
[scilab.git] / scilab / modules / sparse / help / ja_JP / decomposition / spchol.xml
1 <?xml version="1.0" encoding="UTF-8"?>
2 <!--
3  * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
4  * Copyright (C) XXXX-2008 - INRIA
5  * 
6  * This file must be used under the terms of the CeCILL.
7  * This source file is licensed as described in the file COPYING, which
8  * you should have received as part of this distribution.  The terms
9  * are also available at    
10  * http://www.cecill.info/licences/Licence_CeCILL_V2.1-en.txt
11  *
12  -->
13 <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="ja" xml:id="spchol">
14     <refnamediv>
15         <refname>spchol</refname>
16         <refpurpose>疎行列コレスキー分解</refpurpose>
17     </refnamediv>
18     <refsynopsisdiv>
19         <title>呼び出し手順</title>
20         <synopsis>[R,P] = spchol(X)</synopsis>
21     </refsynopsisdiv>
22     <refsection>
23         <title>パラメータ</title>
24         <variablelist>
25             <varlistentry>
26                 <term>X</term>
27                 <listitem>
28                     <para>対称正定実疎行列</para>
29                 </listitem>
30             </varlistentry>
31             <varlistentry>
32                 <term>P</term>
33                 <listitem>
34                     <para>順列行列</para>
35                 </listitem>
36             </varlistentry>
37             <varlistentry>
38                 <term>R</term>
39                 <listitem>
40                     <para>コレスキー分解</para>
41                 </listitem>
42             </varlistentry>
43         </variablelist>
44     </refsection>
45     <refsection>
46         <title>説明</title>
47         <para>
48             <literal>[R,P] = spchol(X)</literal> は,
49             <literal>P*R*R'*P' = X</literal>となるような
50             上三角行列<literal>R</literal> を出力します.
51         </para>
52     </refsection>
53     <refsection>
54         <title>例</title>
55         <programlisting role="example"><![CDATA[ 
56 X=[
57 3.,  0.,  0.,  2.,  0.,  0.,  2.,  0.,  2.,  0.,  0. ;
58 0.,  5.,  4.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0. ;
59 0.,  4.,  5.,  0.,  0.,  0.,  0.,  0.,  0.,  0.,  0. ;
60 2.,  0.,  0.,  3.,  0.,  0.,  2.,  0.,  2.,  0.,  0. ;
61 0.,  0.,  0.,  0. , 5.,  0.,  0.,  0.,  0.,  0.,  4. ;
62 0.,  0.,  0.,  0.,  0.,  4.,  0.,  3.,  0.,  3.,  0. ;
63 2.,  0.,  0.,  2.,  0.,  0.,  3.,  0.,  2.,  0.,  0. ;
64 0.,  0.,  0.,  0.,  0.,  3.,  0.,  4.,  0.,  3.,  0. ;
65 2.,  0.,  0.,  2.,  0.,  0.,  2.,  0.,  3.,  0.,  0. ;
66 0.,  0.,  0.,  0.,  0.,  3.,  0.,  3.,  0.,  4.,  0. ;
67 0.,  0.,  0.,  0.,  4.,  0.,  0.,  0.,  0.,  0.,  5.];
68 X=sparse(X);[R,P] = spchol(X);
69 max(P*R*R'*P'-X)
70  ]]></programlisting>
71     </refsection>
72     <refsection role="see also">
73         <title>参照</title>
74         <simplelist type="inline">
75             <member>
76                 <link linkend="sparse">sparse</link>
77             </member>
78             <member>
79                 <link linkend="lusolve">lusolve</link>
80             </member>
81             <member>
82                 <link linkend="luget">luget</link>
83             </member>
84             <member>
85                 <link linkend="chol">chol</link>
86             </member>
87         </simplelist>
88     </refsection>
89 </refentry>