Activity

From 04 Feb 2014 to 05 Mar 2014

19:04 Design #455: Which sets of generators in an ideal?: from issue Bug #446: intersection fails with zero ideal
John Abbott wrote
> What I tried to suggest yesterday, is... Anna Maria Bigatti
18:57 Design #455 (New): Which sets of generators in an ideal?: now we have
@myGens@
@myTidyGens@
but in SparsePolyRing we would also need
@myGBasis@ (currently stored in @myTi... Anna Maria Bigatti

10:06 Feature #209: ReadExpr: input polynomials in CoCoALib: added RingElemInput in documentation (cvs-ed)
(work in progress) Anna Maria Bigatti
10:03 Support #452: Documentation for adding functions to CoCoA-5 (BuiltInFunctions and BuiltInOneLiners): I added an entry to the CoCoALib documentation. (cvs-ed)
Just started
Anna Maria Bigatti
09:31 Support #452 (Closed): Documentation for adding functions to CoCoA-5 (BuiltInFunctions and BuiltInOneLiners): Code is very readable, but some documentation would be nice, wouldn't it?
*2014-07* the documentation is in doc/tx... Anna Maria Bigatti

17:10 Feature #426: ConvertTo with optional arg to give more helpful error message: added example and documentation (cvs-ed) Anna Maria Bigatti
16:30 Feature #426 (Feedback): ConvertTo with optional arg to give more helpful error message: Jon implemented this and forgot to say it?
anyway it is very nice:
code was... Anna Maria Bigatti

21:20 Feature #442 (New): Eigenvectors: Clean up impl of @eigenvectors@ and translate it into C++.
Ideally it should perhaps use algebraic extensions? John Abbott

17:17 Bug #413: OrdvArith: use of a single buffer is NOT THREADSAFE: Thanks Christof for trying the hacked code. I'm both surprised and relieved that there was no significant improvemen... John Abbott
16:11 Bug #413: OrdvArith: use of a single buffer is NOT THREADSAFE: I tried the change. It is really hard to tell if there is a difference. It seems to be slightly faster on some exampl... Christof Soeger

12:02 Bug #413: OrdvArith: use of a single buffer is NOT THREADSAFE: Christof could you make some further tests after modifying slightly the OpenMP version of the @OrdvArith@ code I sent... John Abbott

16:30 Feature #342: Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP)): My non-authorative solution is... Winfried Bruns

20:10 Feature #440: Port RealRoots to C++: Make the code prefer "binary rationals" as much as possible; exploit this fact when evaluating the polynomial. In an... John Abbott
20:04 Feature #440 (New): Port RealRoots to C++: Port the @RealRoots@ code to C++ so that it is accessible to CoCoALib users!
I hope that a well-written port might... John Abbott

16:52 Support #438: Polynomial multiplication (product of RingElem): I am sorry for having raised a non-issue.
Regarding NumTerms: is it a data field of the polynomial or is it compu... Winfried Bruns
16:08 Support #438: Polynomial multiplication (product of RingElem): Winfried Bruns wrote:
> I think it is a question that needs careful testing before any changes should be done. As ob... Anna Maria Bigatti
12:48 Support #438: Polynomial multiplication (product of RingElem): I think it is a question that needs careful testing before any changes should be done. As observed by John and mentio... Winfried Bruns
09:50 Support #438 (In Progress): Polynomial multiplication (product of RingElem): In @SparsePolyRing.C -- myMul@ there is this code... Anna Maria Bigatti

15:40 Support #438: Polynomial multiplication (product of RingElem): [from an email sent to Bruns] I do recall that there are complications for inserting the terms in the correct order; ... John Abbott
15:33 Support #438 (In Progress): Polynomial multiplication (product of RingElem): Bruns asks whether @f*g@ and @g*f@ take the same time or whether one way round is better than the other. He mentions... John Abbott
15:18 Feature #437 (In Progress): MemPool: order free blocks?: Computation speed in C5 often degrades over time; I think this may be due to loss of data locality in the RAM. In an... John Abbott
15:14 Feature #142 (In Progress): Improve threadsafety: John Abbott
10:43 Feature #342: Remove denominators: QQ[x] -> ZZ[x] (and PushBack(coeff, PP)): This function seems to be optimal.
What is the authorative function for the converse transformation ZZ[X] --> QQ[X] ? Winfried Bruns

00:47 Feature #436 (New): Improve UPoly eval at BigRat for binary rational: It should be possible to make @EvalUPoly@ faster for binary rationals (_i.e._ whose denom is a power of 2)
John Abbott

19:42 Bug #413: OrdvArith: use of a single buffer is NOT THREADSAFE: On our compute server with 20 threads the performance was about 5% better with the OpenMP adaptation for some medium ... Christof Soeger

Also available in: Atom

CoCoA » CoCoALib