CoCoA » CoCoALib

06 Apr 2018

20:54 Design #1179: Clean up SparsePolyOps-MonomialIdeals

converted code for *@PrimaryDecomposition_MonId@* into a member function.
Anna Maria Bigatti

20:52 Design #1179 (In Progress): Clean up SparsePolyOps-MonomialIdeals

Now that we have made some decisions about the design for ideals of some special sort, clean up *@SparsePolyOps-Monom... Anna Maria Bigatti

20:29 Feature #1178 (In Progress): New function: myPrimaryDecomposition_0dim

Created stucture.
Translated the uppermost function.
Anna Maria Bigatti

20:27 Feature #1178 (Closed): New function: myPrimaryDecomposition_0dim

Translate the code from the CoCoAPackage @PrimaryDecomposition0.cpkg5@ into CoCoALib Anna Maria Bigatti

18:57 Design #1177: File names: use "SparsePolyOps" prefix for pertinent files

Now we have... Anna Maria Bigatti

18:51 Design #1177 (Closed): File names: use "SparsePolyOps" prefix for pertinent files

Use of a prefix is a convenient way to mimick subdirectories. Anna Maria Bigatti

05 Apr 2018

15:11 Feature #1176: interval arithmetic

There is an interval arithmetic sublibrary in the BOOST distribution.
The problem with depending on an external libr... John Abbott

13:41 Feature #1176 (In Progress): interval arithmetic

Implement interval arithmetic (for intervals with rational end points).
Some software libraries already implement ... John Abbott

04 Apr 2018

11:52 Feature #1173: Upper bound for value of poly in an interval

A while ago I read an article about this (perhaps "evaluating a polynomial over an interval"?). I no longer recall m... John Abbott

11:49 Feature #1173 (New): Upper bound for value of poly in an interval

Write a function which accepts a (univariate) polynomial *f* (with rational coeffs), and an interval *[a,b]* with rat... John Abbott

03 Apr 2018

12:20 Slug #1170 (In Progress): SmoothFactor: slow when a factor is found

I have found the slug: I had activated the "clever idea" of testing for @IsProbPrim@ after a factor has been bound, *... John Abbott

29 Mar 2018

23:03 Design #1168: ideal: does const ourGetPtr really need to be private?

It is very convenient having it public :-) :-)
... but today I used it to set the radical/maximal/... flags at the... Anna Maria Bigatti

22:59 Design #924: FlagManager for bool/bool3 flags

Anna Maria Bigatti wrote:
> Suggested names for the functions modifying this:
> @ComputeAndSetIsPrime3@, @ComputeAn... Anna Maria Bigatti

28 Mar 2018

20:25 Slug #1170 (Closed): SmoothFactor: slow when a factor is found

Consider the following:... John Abbott

20 Mar 2018

12:15 Support #1149 (In Progress): Release: CoCoALib-0.99600 (together with CoCoA-5.2.4)

Anna Maria Bigatti

19 Mar 2018

14:24 Feature #1169: New function: RandomLinearForm (CoCoALib)

John Abbott wrote:
> I am not so convinced of the utility of @RandomLinearForm(P,lo,hi)@, and suggest commenting it ... Anna Maria Bigatti

13:26 Feature #1169: New function: RandomLinearForm (CoCoALib)

I am not so convinced of the utility of @RandomLinearForm(P,lo,hi)@, and suggest commenting it out until we find a ge... John Abbott

09:52 Feature #1169 (Resolved): New function: RandomLinearForm (CoCoALib)

Done.
*RandomLinearForm(P)* -- if coeff ring of P is F_p
*RandomLinearForm(P, n)* -- same as _RandomLinearForm(P, -... Anna Maria Bigatti

09:49 Feature #1169 (Closed): New function: RandomLinearForm (CoCoALib)

Port @RandomLinearForm@ to CoCoALib Anna Maria Bigatti

17 Mar 2018

09:16 Slug #1165: MinPoly over QQ: verification may be very slow

Working well, but now this should also be accessible by @IsRadical, IsMaximal,...@
Think well before doing this!! Anna Maria Bigatti

09:15 Design #1168: ideal: does const ourGetPtr really need to be private?

After discussing with John, I made it public.
Indeed the rest of the code is clenear, i.e. we do not need so many fr... Anna Maria Bigatti

16 Mar 2018

08:57 Slug #1165: MinPoly over QQ: verification may be very slow

After many many experiments, code is settled as this:
- *MinPolyQuot(f, I, x)* makes the complete verification (over... Anna Maria Bigatti

15 Mar 2018

14:12 Design #1168 (In Progress): ideal: does const ourGetPtr really need to be private?

If many functions have to be @friend@ that is not a good sign.
I'm too busy to think about it now, so suggest making... John Abbott

10:10 Design #1168 (In Progress): ideal: does const ourGetPtr really need to be private?

To be able to call this... Anna Maria Bigatti

13 Mar 2018

18:48 Feature #1167 (In Progress): New class VerificationLevel

JAA has checked in a first impl (using KISS philosophy).
Anna will test it shortly.
The idea is that fns which ... John Abbott

18:43 Feature #1167 (Closed): New class VerificationLevel

To help offer the user the chance to choose between guaranteed algorithms and fast, probably-correct ones,
create a ... John Abbott

12 Mar 2018

16:45 Feature #1131 (Resolved): Sturm sequence

The implementation seems to be mostly complete (for coeffs in QQ).
The elements of the sequence are scaled so that t... John Abbott

11:51 Design #1166 (In Progress): C++11: allows large integer literals (in NumTheory-prime.C)

I'd like the code to compile whenever a 64-bit (or wider) integer type is available. This is guaranteed if the C++ s... John Abbott

11:47 Design #1166 (Closed): C++11: allows large integer literals (in NumTheory-prime.C)

I would like to include some "large" (greater than 2^32) integer literals in @NumTheory-prime.C@.
This cannot be d... John Abbott

08:57 Slug #1165: MinPoly over QQ: verification may be very slow

Tried with TwinFloat: good for the 87 points (10 times faster) bad for example QQ-rand (10 times slower)
Anna Maria Bigatti

08:24 Slug #1165: MinPoly over QQ: verification may be very slow

An impressive example is given by 87 points in QQ^3.
@MinPoly@ takes ~4s and the verification take 44s on my Mac.
... Anna Maria Bigatti

08:05 Slug #1165 (Closed): MinPoly over QQ: verification may be very slow

The verification step after the modular algorithm may be very slow.
On the other side it is easy to construct exampl... Anna Maria Bigatti

09 Mar 2018

18:18 Design #950: factor and SmoothFactor for integers --> FactorINT, FactorINT_TrialDiv, FactorINT_PollardRho

Maybe there could be a fn called *@IsPrime3@* which is guaranteed (reasonably) fast, and returns a @bool3@?
John Abbott

18:14 Design #1145 (In Progress): File names, coding conventions: Fns, Ops, Operations? part 2

JAA has a preference for *@Ops@* rather than *@Operations@*. I think they are equally clear, and see no advantage in... John Abbott

18:08 Feature #1155 (Resolved): Create a new "prime source" iterator

I have added 4 "iterators: *@PrimeSeq@*, *@PrimeSeqForCRT@*, *@FastMostlyPrimeSeq@*, *@NoSmallFactorsSeq@*.
First ... John Abbott

18:05 Design #1162: Check semantics of NoSmallFactorSeq

Currently the choice of biggest prime which is "filtered" is somewhat arbitrary.
Is it worth doing anything more ref... John Abbott