--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) 2006-2008 - INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="gcd">
+ <refnamediv>
+ <refname>gcd</refname>
+ <refpurpose>наибольший общий делитель (НОД)</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>[pgcd, U]=gcd(p)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>p</term>
+ <listitem>
+ <para>
+ вектор-строка полиномиальных значений <literal>p=[p1, ..., pn]</literal>
+ либо вектор-строка целочисленных значений (тип 8).
+ </para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ <code>[pgcd, U]=gcd(p)</code> вычисляет наибольший общий делитель элементов <varname>p</varname>
+ (<varname>pgcd</varname>) и унимодулярной матрицы (с полиномиальной инверсией) <varname>U</varname>, с минимальной степенью такая, что
+ </para>
+ <para>
+ <literal>p*U=[0 ... 0 pgcd]</literal>.
+ </para>
+ <para>
+ В математике <emphasis role='italic'>унимодулярная</emphasis> матрица
+ <literal>U</literal> - это квадратная с целочисленными элементами,
+ определитель которой равен <literal>+1</literal> или <literal>-1</literal>.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+//случай полиномов
+s=poly(0,'s');
+p=[s,s*(s+1)^2,2*s^2+s^3];
+[pgcd,u]=gcd(p);
+p*u
+//случай целых чисел
+V=int32([2^2*3^5, 2^3*3^2,2^2*3^4*5]);
+[thegcd,U]=gcd(V)
+V*U
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="bezout">bezout</link>
+ </member>
+ <member>
+ <link linkend="lcm">lcm</link>
+ </member>
+ <member>
+ <link linkend="hermit">hermit</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) 2006-2008 - INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="lcm">
+ <refnamediv>
+ <refname>lcm</refname>
+ <refpurpose>наименьшее общее кратное (НОК)</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>[pp, fact] = lcm(p)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>p</term>
+ <listitem>
+ <para>
+ вектор-строка полиномиальных значений <literal>p = [p1, ..., pn]</literal> либо
+ вектор-строка целочисленных значений (тип 8).
+ </para>
+ </listitem>
+ </varlistentry>
+ <varlistentry>
+ <term>fact</term>
+ <listitem>
+ <para>
+ вектор полиномиальных или целочисленных значений (тип 8).
+ </para>
+ </listitem>
+ </varlistentry>
+ <varlistentry>
+ <term>pp</term>
+ <listitem>
+ <para>полином или целое число.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ <code>pp=lcm(p)</code> вычисляет наименьшее общее кратное <varname>pp</varname> вектора полиномиальных значений <varname>p</varname>.
+ </para>
+ <para>
+ <code>[pp, fact]=lcm(p)</code> вычисляет дополнительно вектор <varname>fact</varname> такой, что:
+ </para>
+ <para>
+ <code>p.*fact=pp*ones(p)</code>.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+//случай полиномов
+s=poly(0,'s');
+p=[s,s*(s+1)^2,s^2*(s+2)];
+[pp,fact]=lcm(p);
+p.*fact, pp
+
+//случай целых чисел
+V=int32([2^2*3^5, 2^3*3^2,2^2*3^4*5]);
+lcm(V)
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="gcd">gcd</link>
+ </member>
+ <member>
+ <link linkend="bezout">bezout</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) 2008 - INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="expm">
+ <refnamediv>
+ <refname>expm</refname>
+ <refpurpose>квадратная матрица экспоненциальной функции</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>expm(X)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>X</term>
+ <listitem>
+ <para>
+ квадратная матрица с вещественными или комплексными элементами.
+ </para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ Если <varname>X</varname> - квадратная матрица, то <literal>expm(X)</literal> - это матрица:
+ </para>
+ <para>
+ <literal>expm(X) = I + X + X^2 /2 + ...</literal>
+ </para>
+ <para>
+ Вычисление выполняется диагонализация первого блока <varname>X</varname>
+ а затем применяя аппроксимацию Паде к каждому блоку.
+ </para>
+ <para>
+ Аппроксимация Паде — классический метод рациональной аппроксимации аналитических функций, названный по имени французского математика Анри Паде.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+X=[1 2;3 4]
+expm(X)
+logm(expm(X))
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="logm">logm</link>
+ </member>
+ <member>
+ <link linkend="bdiag">bdiag</link>
+ </member>
+ <member>
+ <link linkend="coff">coff</link>
+ </member>
+ <member>
+ <link linkend="log">log</link>
+ </member>
+ <member>
+ <link linkend="exp">exp</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) 2008 - INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="polar">
+ <refnamediv>
+ <refname>polar</refname>
+ <refpurpose>полярная форма</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>[Ro, Theta] = polar(A)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>A</term>
+ <listitem>
+ <para>вещественная или комплексная квадратная матрица.</para>
+ </listitem>
+ </varlistentry>
+ <varlistentry>
+ <term>Ro</term>
+ <listitem>
+ <para>вещественная матрица.</para>
+ </listitem>
+ </varlistentry>
+ <varlistentry>
+ <term>Theta</term>
+ <listitem>
+ <para>вещественная или комплексная матрица.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ <code>[Ro, Theta]=polar(A)</code> возвращает полярную (тригонометрическую)
+ форму матрицы <varname>A</varname>, то есть <code>A=Ro*expm(%i*Theta)</code>,
+ где <varname>Ro</varname> симметричная матрица >=0 и <varname>Theta</varname> эрмитова матрица
+ >=0.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+A=rand(5,5);
+[Ro, Theta]=polar(A);
+norm(A-Ro*expm(%i*Theta),1)
+
+B = complex(5,7)
+[M, P] = polar(B)
+M * exp(%i * P)
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="expm">expm</link>
+ </member>
+ <member>
+ <link linkend="svd">svd</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) 2008 - INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="squeeze">
+ <refnamediv>
+ <refname>squeeze</refname>
+ <refpurpose>removes singleton dimensions of a hypermatrix</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>hypOut = squeeze(hypIn)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>hypIn</term>
+ <listitem>
+ <para>гиперматрица или матрица, тип constant.</para>
+ </listitem>
+ </varlistentry>
+ <varlistentry>
+ <term>hypOut</term>
+ <listitem>
+ <para>гиперматрица или матрица, тип constant.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ Функция <function>squeeze</function> удаляет единичные размерности гиперматрицы,
+ то есть любую размерность, величина которой равна <literal>1</literal>. Если
+ входной аргумент <varname>hypIn</varname> - обычная матрица, то эта функция не
+ оказывает влияния.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+ M1 = zeros(2,1,5)
+ squeeze(M1)
+ squeeze(M1(:,:,1))
+
+ M2 = hypermat([2 1 2 1],1:4)
+ squeeze(M2)
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="hypermat">hypermat</link>
+ </member>
+ <member>
+ <link linkend="hypermatrices">hypermatrices</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="addf">
+ <refnamediv>
+ <refname>addf</refname>
+ <refpurpose>символьное суммирование</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>c = addf(a, b)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>a, b, c</term>
+ <listitem>
+ <para>символьные строки.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ Функция <function>addf</function> выполняет символьное суммирование.
+ <code>c = addf("a", "b")</code> возвращает символьную строку <varname>c</varname>,
+ которая равна <literal>"a + b"</literal>. Выполняются простейшие упрощения, такие как <code>addf("0", "a")</code> или <code>addf("1", "2")</code>.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+addf('0','1')
+addf('1','a')
+addf('1','2')
+addf('a','b')
+'a'+'b'
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="mulf">mulf</link>
+ </member>
+ <member>
+ <link linkend="subf">subf</link>
+ </member>
+ <member>
+ <link linkend="ldivf">ldivf</link>
+ </member>
+ <member>
+ <link linkend="rdivf">rdivf</link>
+ </member>
+ <member>
+ <link linkend="eval">eval</link>
+ </member>
+ <member>
+ <link linkend="evstr">evstr</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) 2008 - INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="cmb_lin">
+ <refnamediv>
+ <refname>cmb_lin</refname>
+ <refpurpose>символьное линейное сочетание</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>[x] = cmb_lin(alfa, x, beta, y)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>alfa, beta, x, y</term>
+ <listitem>
+ <para>символьные строки.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ Выполняет символьное линейное сочетание <code>alfa*x-beta*y</code>. (Низкоуровневая программа).
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+cmb_lin('alfa','x','beta','y')
+cmb_lin('alfa','x','beta','-y')
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="mulf">mulf</link>
+ </member>
+ <member>
+ <link linkend="addf">addf</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="ldivf">
+ <refnamediv>
+ <refname>ldivf</refname>
+ <refpurpose>левое символьное деление</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>ldivf(d, c)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>d, c</term>
+ <listitem>
+ <para>символьные строки.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ <code>ldivf('d', 'c')</code> выполняет левое символьное деление (деление справа
+ налево) и возвращает строку <literal>'c\d'</literal>. Выполняются такие
+ простейшие упрощения как <literal>'1\c' = 'c'</literal>.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+ldivf('1','1')
+ldivf('a','0')
+ldivf('a','x')
+ldivf('2','4')
+ldivf('0','a') // Осторожно, ошибка...
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="rdivf">rdivf</link>
+ </member>
+ <member>
+ <link linkend="addf">addf</link>
+ </member>
+ <member>
+ <link linkend="mulf">mulf</link>
+ </member>
+ <member>
+ <link linkend="evstr">evstr</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="mulf">
+ <refnamediv>
+ <refname>mulf</refname>
+ <refpurpose>символьное умножение</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>mulf(d, c)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>d, c</term>
+ <listitem>
+ <para>символьные строки.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ <code>mulf('d', 'c')</code> выполняет символьное умножение и возвращает
+ строковое значение <literal>'c*d'</literal>. Выполняются такие простейшие
+ упрощения как <literal>'1*c' = 'c'</literal>.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+mulf('1','a')
+mulf('0','a')
+'a'*'b' // Осторожно, ошибка...
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="rdivf">rdivf</link>
+ </member>
+ <member>
+ <link linkend="addf">addf</link>
+ </member>
+ <member>
+ <link linkend="subf">subf</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="rdivf">
+ <refnamediv>
+ <refname>rdivf</refname>
+ <refpurpose>правое символьное деление</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>[r] = rdivf(d, c)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>d, c, r </term>
+ <listitem>
+ <para>символьные строки.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ <code>r=rdivf("d", "c")</code> выполняет правое символьное деление (деление слева
+ направо) и возвращает строку <varname>r</varname>, которая равна
+ <literal>"c/d"</literal>. Выполняются такие простейшие упрощения как
+ <literal>"c/1" = "c"</literal>.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+rdivf('c','d')
+rdivf('1','2')
+rdivf('0','a')
+rdivf('a','0') // Осторожно, ошибка...
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="ldivf">ldivf</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
--- /dev/null
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+ * Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ * Copyright (C) INRIA
+ *
+ * This file must be used under the terms of the CeCILL.
+ * This source file is licensed as described in the file COPYING, which
+ * you should have received as part of this distribution. The terms
+ * are also available at
+ * http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ -->
+<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="ru" xml:id="subf">
+ <refnamediv>
+ <refname>subf</refname>
+ <refpurpose>символьное вычитание</refpurpose>
+ </refnamediv>
+ <refsynopsisdiv>
+ <title>Последовательность вызова</title>
+ <synopsis>[c] = subf(a, b)</synopsis>
+ </refsynopsisdiv>
+ <refsection>
+ <title>Аргументы</title>
+ <variablelist>
+ <varlistentry>
+ <term>a, b, c</term>
+ <listitem>
+ <para>символьные строки.</para>
+ </listitem>
+ </varlistentry>
+ </variablelist>
+ </refsection>
+ <refsection>
+ <title>Описание</title>
+ <para>
+ <code>c = subf("a", "b")</code> выполняет символьное вычитание и возвращает символьную строку <varname>c</varname>, которая равна <literal>"a-b"</literal>. Выполняются такие простейшие упрощения как <literal>subf("0","a")</literal> или
+ <literal>subf("1","2")</literal>.
+ </para>
+ </refsection>
+ <refsection>
+ <title>Примеры</title>
+ <programlisting role="example"><![CDATA[
+subf('0','a')
+subf('2','1')
+subf('a','0')
+ ]]></programlisting>
+ </refsection>
+ <refsection role="see also">
+ <title>Смотрите также</title>
+ <simplelist type="inline">
+ <member>
+ <link linkend="addf">addf</link>
+ </member>
+ <member>
+ <link linkend="mulf">mulf</link>
+ </member>
+ <member>
+ <link linkend="ldivf">ldivf</link>
+ </member>
+ <member>
+ <link linkend="rdivf">rdivf</link>
+ </member>
+ <member>
+ <link linkend="eval">eval</link>
+ </member>
+ <member>
+ <link linkend="evstr">evstr</link>
+ </member>
+ </simplelist>
+ </refsection>
+</refentry>
projects / scilab.git / commitdiff