Changeset edfd36 in git for Singular/LIB/urrcount.lib

Timestamp:

May 6, 2005, 1:17:33 PM (18 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', '8e0ad00ce244dfd0756200662572aef8402f13d5')

Children:

7acf9bf2b74329722c5db8dcbfad38aefc35a663

Parents:

6ed9240d0e05977f97c2c93af491078329ba7b6d

Message:

*GMG: help


git-svn-id: file:///usr/local/Singular/svn/trunk@8063 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/urrcount.lib (modified) (13 diffs)

Singular/LIB/urrcount.lib

@@ -1 @@
-// $Id: urrcount.lib,v 1.4 2005-05-06 09:42:01 Singular Exp $
+// $Id: urrcount.lib,v 1.5 2005-05-06 11:17:33 Singular Exp $
 // E. Tobis  12.Nov.2004, April 2004
-// last change 1. May 2005 (G.-M. Greuel)
+// last change 5. May 2005 (G.-M. Greuel)
 ///////////////////////////////////////////////////////////////////////////////
 category="Symbolic-numerical solving"
@@ -63 +63 @@
 proc isparam(list #)
 "USAGE:     isparam(ideal/module/poly/list);
-RETURN:    int: 0 if the argument is not parametric and 1 if it
+RETURN:    int: 0 if the argument has non-parametric coefficients
+           and 1 if it has
 EXAMPLE:   example isparam; shows an example"
 {
@@ -218 +219 @@
 proc varsigns(list l)
 "USAGE:     varsigns(l); list l.
-RETURN:    number: the number of sign changes in the list l
+RETURN:    int: the number of sign changes in the list l
 SEE ALSO:  boundposDes
 EXAMPLE:   example varsigns; shows an example"
@@ -251 +252 @@
 proc boundBuFou(poly p,number a,number b)
 "USAGE:     boundBuFou(p,a,b); p poly, a,b number
-RETURN:    number: an upper bound for the number of real roots of p in (a,b],
+RETURN:    int: an upper bound for the number of real roots of p in (a,b],
            with the same parity as the actual number of roots (using the
            Budan-Fourier Theorem)
@@ -315 +316 @@
 proc boundposDes(poly p)
 "USAGE:     boundposDes(p); poly p
-RETURN:    number: an upper bound for the number of positive roots of p, with
+RETURN:    int: an upper bound for the number of positive roots of p, with
            the same parity as the actual number of positive roots of p.
 ASSUME:    p is a univarite polynomials with rational coefficients
@@ -369 +370 @@
 proc boundDes(poly p)
 "USAGE:     boundDes(p); poly p
-RETURN:    number: an upper bound for the number of real roots of p, with
+RETURN:    int: an upper bound for the number of real roots of p, with
            the same parity as the actual number of real roots of p.
 ASSUME:    p is a univarite polynomials with rational coefficients
@@ -434 +435 @@
 proc allrealst(poly p)
 "USAGE:     allrealst(p); poly p
-RETURN:    int: 1 iff all the roots of p are real, 0 otherwise
+RETURN:    int: 1 iff all the roots of p are real, 0 otherwise.
            Checks whether all the roots of p are real by using Sturm's Theorem
 ASSUME:    p is a univarite polynomials with rational coefficients
@@ -506 +507 @@
 proc sturm(poly p,number a,number b)
 "USAGE:     sturm(p,a,b); poly p, number a,b
-RETURN:    number: the number of real roots of p in (a,b]
+RETURN:    int: the number of real roots of p in (a,b]
 ASSUME:    p is a univarite polynomials with rational coefficients,
            a, b are rational numbers with a < b
@@ -630 +631 @@
 proc allreal(poly p)
 "USAGE:     allreal(p);
-RETURN:    bool: 1 iff all the roots of p are real
+RETURN:    int: 1 iff all the roots of p are real, 0 otherwise
 SEE ALSO:  allrealst
 EXAMPLE:   example allreal; shows an example"
@@ -664 +665 @@
 proc sturmha(poly P,number a,number b)
 "USAGE:     sturmha(p,a,b); poly p, number a,b
-RETURN:    number: the number of real roots of p in (a,b) (using a
+RETURN:    int: the number of real roots of p in (a,b) (using a
            Sturm-Habicht sequence)
 SEE ALSO:  sturm,allreal
@@ -674 +675 @@
   poly variable;
   number bound;
-  number result;
+  //number result;
+  int result;
 
   if (isparam(P) || isparam(a) || isparam(b)) {
@@ -834 +836 @@
 proc nrroots(poly p)
 "USAGE:     nrroots(p); poly p
-RETURN:    number: the number of real roots of p
+RETURN:    int: the number of real roots of p
 SEE ALSO:  boundposDes, sturm, sturmha
 EXAMPLE:   example nrroots; shows an example"
@@ -1031 +1033 @@
 
 
+