diff options
| author | dos-reis <gdr@axiomatics.org> | 2011-03-12 19:17:32 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2011-03-12 19:17:32 +0000 |
| commit | c93e84048964194e5674e859d6bd8827010f09f6 (patch) | |
| tree | 407ca23d232bf3f974550fce0175c49495ef49c0 /src/algebra/crfp.spad.pamphlet | |
| parent | 52fddea19454dc2b9bcb54c6edd5a4cd4f5765a9 (diff) | |
| download | open-axiom-c93e84048964194e5674e859d6bd8827010f09f6.tar.gz | |
* src/algebra/: Systematically use negative? when comparing for
greater than 0.
Diffstat (limited to 'src/algebra/crfp.spad.pamphlet')
| -rw-r--r-- | src/algebra/crfp.spad.pamphlet | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/algebra/crfp.spad.pamphlet b/src/algebra/crfp.spad.pamphlet index 1ac1ba20..8bbd8ee9 100644 --- a/src/algebra/crfp.spad.pamphlet +++ b/src/algebra/crfp.spad.pamphlet @@ -306,7 +306,7 @@ ComplexRootFindingPackage(R, UP): public == private where -- next we check if one of these centers is a root centerIsRoot : Boolean := false for i in 1..maxIndex lp repeat - if (mD := minimumDegree lp.i) > 0 then + if positive? (mD := minimumDegree lp.i) then pp : UP := monomial(1,1)-monomial(listOfCenters.i-u,0) centerIsRoot := true fp := fp * irreducibleFactor(pp,mD) @@ -418,7 +418,7 @@ ComplexRootFindingPackage(R, UP): public == private where divisorCascade(p, tp, info) == lfae : L FAE := nil() - for i in 1..degree tp while (degree tp > 0) repeat + for i in 1..degree tp while positive? degree tp repeat -- USE monicDivide !!! qr : Record(quotient: UP, remainder: UP) := divide(p,tp) factor1 : UP := tp |