← Back to branch summary

~ubuntu-branches/ubuntu/hoary/scilab/hoary

« back to all changes in this revision

Viewing changes to man/eng/polynomials/bezout.xml

  • Committer: Bazaar Package Importer
  • Author(s): Torsten Werner
  • Date: 2005-01-09 22:58:21 UTC
  • mfrom: (1.1.1 upstream)
  • Revision ID: james.westby@ubuntu.com-20050109225821-473xr8vhgugxxx5j
Tags: 3.0-12
http://bugs.debian.org/255869
changed configure.in to build scilab's own malloc.o, closes: #255869

Show diffs side-by-side

added added

removed removed

Lines of Context:
man/eng/polynomials/bezout.xml
 
1
<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
 
2
<!DOCTYPE MAN SYSTEM "../../manrev.dtd">
 
3
<MAN>
 
4
  <LANGUAGE>eng</LANGUAGE>
 
5
  <TITLE>bezout</TITLE>
 
6
  <TYPE>Scilab Function</TYPE>
 
7
  <DATE>April 1993</DATE>
 
8
  <SHORT_DESCRIPTION name="bezout"> Bezout equation for polynomials or integers</SHORT_DESCRIPTION>
 
9
  <CALLING_SEQUENCE>
 
10
    <CALLING_SEQUENCE_ITEM>[thegcd,U]=bezout(p1,p2)   </CALLING_SEQUENCE_ITEM>
 
11
  </CALLING_SEQUENCE>
 
12
  <PARAM>
 
13
    <PARAM_INDENT>
 
14
      <PARAM_ITEM>
 
15
        <PARAM_NAME>p1, p2</PARAM_NAME>
 
16
        <PARAM_DESCRIPTION>
 
17
          <SP>: two real polynomials or two integer scalars (type equal to 8)</SP>
 
18
        </PARAM_DESCRIPTION>
 
19
      </PARAM_ITEM>
 
20
    </PARAM_INDENT>
 
21
  </PARAM>
 
22
  <DESCRIPTION>
 
23
    <P><VERB>[thegcd,U]=bezout(p1,p2)</VERB> computes GCD <VERB>thegcd</VERB> of <VERB>p1</VERB> and <VERB>p2</VERB> and in addition a (2x2) 
 
24
    unimodular matrix <VERB>U</VERB> such that:</P>
 
25
    <P>
 
26
      <VERB>[p1,p2]*U = [thegcd,0]</VERB>
 
27
    </P>
 
28
    <P>
 
29
    The lcm of <VERB>p1</VERB> and <VERB>p2</VERB> is given by:</P>
 
30
    <P><VERB>p1*U(1,2)</VERB> (or <VERB>-p2*U(2,2)</VERB>)</P>
 
31
  </DESCRIPTION>
 
32
  <EXAMPLE>
 
33
<![CDATA[
 
34
// polynomial case
 
35
x=poly(0,'x');
 
36
p1=(x+1)*(x-3)^5;p2=(x-2)*(x-3)^3;
 
37
[thegcd,U]=bezout(p1,p2) 
 
38
det(U)
 
39
clean([p1,p2]*U)
 
40
thelcm=p1*U(1,2)
 
41
lcm([p1,p2])
 
42
// integer case
 
43
i1=int32(2*3^5); i2=int32(2^3*3^2);
 
44
[thegcd,U]=bezout(i1,i2) 
 
45
V=int32([2^2*3^5, 2^3*3^2,2^2*3^4*5]);
 
46
[thegcd,U]=gcd(V)
 
47
V*U
 
48
lcm(V)
 
49
 ]]>
 
50
  </EXAMPLE>
 
51
  <SEE_ALSO>
 
52
    <SEE_ALSO_ITEM>
 
53
      <LINK>poly</LINK>
 
54
    </SEE_ALSO_ITEM>
 
55
    <SEE_ALSO_ITEM>
 
56
      <LINK>roots</LINK>
 
57
    </SEE_ALSO_ITEM>
 
58
    <SEE_ALSO_ITEM>
 
59
      <LINK>simp</LINK>
 
60
    </SEE_ALSO_ITEM>
 
61
    <SEE_ALSO_ITEM>
 
62
      <LINK>clean</LINK>
 
63
    </SEE_ALSO_ITEM>
 
64
    <SEE_ALSO_ITEM>
 
65
      <LINK>lcm</LINK>
 
66
    </SEE_ALSO_ITEM>
 
67
  </SEE_ALSO>
 
68
  <AUTHOR> S. Steer INRIA</AUTHOR>
 
69
</MAN>