Activity
From 04 Apr 2016 to 03 May 2016
03 May 2016
-
13:14 Slug #874: factor: too slow on largish multivariate poly
- Mario has just sent me an even bigger polynomial to try: 100 indets, about 127000 terms, total degree 9.
He also m... -
- Computing all contents takes about 44s; and computing contents wrt all indets which appear just linearly takes about ...
-
- Mario has given me an example poly. The poly ring has 84 indets; the poly itself uses 69 indets, and has about 6800 ...
-
- Mario generates lots of multivariate polys (over @QQ@); most of them are irreducible. He reports that factorization ...
-
- Mario has given me an updated version of his code. He has used the @__cplusplus@ preprocessor variable to have code ...
29 Apr 2016
-
22:00 Feature #873: bool3: add some logical operations?
- (Maybe this is what you had in mind from the beginning)
I think the only safe definition for @and3@ is the @and@ bet... -
- The "monomial generators" case is easy.
The "is a monomial ideal" is hard in any case: even if both ideals are not m... -
- I expect in some cases we want
uncertain3 and false3 = false3 (sum of ideals has monomial generators)
and other t... -
- It would not be harmful to your code if @bool3@ offered the functions, but you may be right that it would not simplif...
28 Apr 2016
-
- I'm against this idea. Indeed it might be handy, but dangerous as well: while working on fixing a bug on the bool3 f...
27 Apr 2016
-
- BOOST also offers a "not" operation. It would be trivial to implement @not3@ (giving value 1 - arg).
If we do off... -
- Part of the motivation comes from Anna's rectification of code for ideal arithmetic (see issue #870).
For example ... -
- I suggest adding the following two operations:
* *and* which is equivalent to "minimum"
* *or* which is equivalent... -
- Currently there are no logical operations on @bool3@ values.
Discuss whether it may be helpful to include some sim...
26 Apr 2016
-
- Currently CoCoALib uses generic code for solving linear systems over small finite fields.
Implement some special c... -
- Review the design of ideals.
Some points to bear in mind:
* an ideal should probably be immutable -- any operatio...
22 Apr 2016
-
- I checked in @IsZeroEvalHorner@ in case you want to play with it.
The call is currently commented out. Just look fo... -
- Anna Maria Bigatti wrote:
> > But I'd like another try: I'm planning to try to implement a sort of recursive Horner.... -
- I seem to recall vaguely seeing a paper by Mourrain (or someone in his group) possibly about this. I think the quest...
-
- Anna Maria Bigatti wrote:
> But I'd like another try: I'm planning to try to implement a sort of recursive Horner. M... -
- I would like to use @unsigned short@ to store @SmallFp@ values, but still have a decent range _i.e._ without the rest...
19 Apr 2016
-
- Perhaps I should have read the @configure@ script better: I have already inserted (ages ago) a warning for versions o...
-
- John Abbott wrote:
> Mario suggested that we could modify the CoCoALib configuration script to check that GMP is at ... -
- Mario suggested that we could modify the CoCoALib configuration script to check that GMP is at least version 5.0.0; c...
-
- Mario has found a web page which explains that the preprocessor flag @__cpluscplus@ has a numerical value indicating ...
18 Apr 2016
-
- John Abbott wrote:
> I suggest adding a probabilistic check of correctness: use the parametric formulas to generate ... -
- I suggest adding a probabilistic check of correctness: use the parametric formulas to generate a random (numerical) p...
13 Apr 2016
-
- John Abbott wrote:
> The example below takes about 12s on my computer, but only about 0.25s if the coeff field is @Z... -
- The example below takes about 12s on my computer, but only about 0.25s if the coeff field is @ZZ/(32003)@. Why is it...
-
- The current impl of @SliceCoreQQ@ is simple rather than efficient.
It uses modular+CRT to build the answer.
Current... -
- Thanks to Anna (grrrr!) you can build CoCoALib (and CoCoA-5) with an uninstalled version of GMP, _i.e._ a "private" v...
-
15:23 Bug #867 (Closed): Compilation Error: C++11 and old GMP-Version
- I tried to compile CoCoALib at our LinuxCluster with a pretty old GMP version (4.3.1) and C++11 activated (with addit...
07 Apr 2016
-
- I have commented out the parts which disable the default assignment. Everything compiled fine, and all tests passed....
06 Apr 2016
-
- Since assignment is allowed for @ring@ (and presumably causes no trouble), I see no reason for blocking it for "speci...
-
- In issue #244 we approved the activation of assignment for objects of type @ring@.
Mario has pointed out that assign...
05 Apr 2016
-
- One possible explanation for @ContFracIter@ being so slow is that its implementation is "very clean" (_e.g._ it uses ...
-
- I have just tried another timing test with a list of about 90000 copies of @fibonacci(400)/fibonacci(401)@ mapped int...
-
- I have just tried a speed test with more complicated rationals (all of the form @p1/p2@ where @p1@ and @p2@ are disti...
-
- I have implemented a variant of @myIsRational@ which uses @SimplestBigRatBetween@. The implementation is certainly m...
04 Apr 2016
-
- I have just read through the code for @RingTwinFloatImpl::myIsRational@ and it looks OK to me.
The only dodgy aspe...
Also available in: Atom