CoCoA » CoCoALib

14 Apr 2015

15:20 Design #683: Module index component in internal compressed representation

OK I can try doing the tests (sometime over the next few days).
John Abbott

13:57 Design #683: Module index component in internal compressed representation

I think 10000 can be replaced by @max_exp@ (how is it called in cocoalib?)
I don't think it is ever used in operation... Anna Maria Bigatti

13:50 Design #683 (Closed): Module index component in internal compressed representation

The internal representation of module in GBasis computations is through an embedding into a polynomial ring.
The ind... Anna Maria Bigatti

14:05 Feature #658: Indets actually in a poly (or vector or matrix)

Here are two potentially related fns:
* @InvolvesOnlyTheseIndets@ which returns a @bool@ -- could be much faster than... John Abbott

13:59 Feature #658: Indets actually in a poly (or vector or matrix)

A possible name: *@IndetsIn@*
I would like to have *IndetsIn* also for a list (which is assumed to be "homogeneous",... John Abbott

11:23 Feature #682: PPMonoid: add fn to check for overflow in products

Perhaps we will need two overflow check fns:
* @myMulOverflowCheck@
* @myMulByIndetPowerOverflowCheck@
It would ... John Abbott

11:18 Feature #682 (New): PPMonoid: add fn to check for overflow in products

I have recently added the fn @PowerOverflowCheck@ for PPs; implemented via mem fn @myPowerOverflowCheck@. Currently ... John Abbott

13 Apr 2015

23:31 Feature #437: MemPool: order free blocks?

I have just looked at some stats about @MemPool@ in one very particular example, and now wonder whether sorting the e... John Abbott

23:25 Feature #681: MemPool: make it easier to get just stats

Currently it is possible to get some stats reports from @MemPool@ objects by doing all of the following:
* @MemPoolD... John Abbott

23:20 Feature #681 (New): MemPool: make it easier to get just stats

I wanted to get some usage stats from @MemPool@ objects; it was not as easy/helpful as I would have liked. John Abbott

22:22 Bug #680: DistrMPolyClean does not use MemPool for summands?

Why is the @MemPool@ object which is given to @DistrMPoly@ ignored?
MemPool logging shows that the summand pool is... John Abbott

22:18 Bug #680 (Resolved): DistrMPolyClean does not use MemPool for summands?

It seems that @DistrMPolyClean@ does not use @MemPool@ for summands even though a suitable @MemPool@ as passed as arg... John Abbott

15:01 Slug #679: power for PPs is too slow

I have implemented a first version. All tests pass. Still needs cleaning; must update doc. I'll pass prototype to ... John Abbott

14:59 Slug #679: power for PPs is too slow

The proposed design is for each @PPMonoid@ to offer 2 fns:
* @myPower@ which just computes the power *without checkin... John Abbott

14:54 Slug #679 (Closed): power for PPs is too slow

Profiling showed that powering PPs incurred a significant time penalty in the (prototype) code for @ImplicitDirect@.
... John Abbott

10 Apr 2015

10:40 Feature #520 (In Progress): Compute inverse in quotient ring (i.e. division in algebraic extn)

Implemented @SparsePolyRingBase::IdealImpl::myDivMod@ for the 0-dimensional case.... Anna Maria Bigatti

09 Apr 2015

21:46 Feature #678: Accumulator (like a geobucket)

Note: perhaps also consider the design of C++ @std::accumulate@? Is there anything in BOOST?
My (vague) idea is t... John Abbott

21:36 Feature #678: Accumulator (like a geobucket)

I have just written @DetDirect@ which computes the sum of many terms (one for each permutation). In order to get dec... John Abbott

21:30 Feature #678 (In Progress): Accumulator (like a geobucket)

Consider creating a general "accumulator" for ring elems, a sort of generalization of a geobucket. John Abbott

02 Apr 2015

17:53 Support #676 (In Progress): Credits to CoCoALib contributors

If we want (and we want) to attract contributions we need to find a proper way to give them credits for their work, a... Anna Maria Bigatti

28 Mar 2015

09:18 Slug #675: Matrix determinant over multivariate poly ring

In my specific instance the direct algorithm (as alternating sum of products) would be best.
The problem with mult... John Abbott

09:16 Slug #675 (In Progress): Matrix determinant over multivariate poly ring

CoCoA can be too slow and require too much RAM for computing determinant of a matrix of multivariate polynomials.
... John Abbott

26 Mar 2015

11:53 Bug #15: Adjoint of a non-invertible matrix

I am planning to implement a direct algorithm: each entry in the @adj@ is just a determinant, and each determinant is... John Abbott

25 Mar 2015

15:59 Bug #15: Adjoint of a non-invertible matrix

Even @AdjByDetOfMinors@ takes too long for a 6x6 matrix of distinct indets. Why?
*2015-03-26 NOTE* I think the prob... John Abbott

15:22 Bug #15: Adjoint of a non-invertible matrix

@adj@ is a very simple function: it chooses between @AdjByDetOfMinors@ and @AdjByInverse@.
What do you think @AdjB... John Abbott

14:52 Bug #15 (In Progress): Adjoint of a non-invertible matrix

I do not recall when, but @adj@ has aleady been added to CoCoALib.
It has a *VERY BAD SLUG*: even after several mi... John Abbott