Activity
From 05 Apr 2015 to 04 May 2015
30 Apr 2015
- 10:07 Feature #520: Compute inverse in quotient ring (i.e. division in algebraic extn)
- Also @x/i@ is working now.
(will cvs it this afternoon) - 07:38 Feature #385: Design new errors using inheritance
- ...
29 Apr 2015
- 19:03 Feature #520: Compute inverse in quotient ring (i.e. division in algebraic extn)
- Polishing up all the code is always long and tedious....
Anyway!
The code is there and it works.
I still have prob... - 15:46 Slug #691 (In Progress): Matrix determinant over ZZ
- Hint: @DenseMatrix.C:462@ the dispatch function @DenseMatImpl::myDet@ does not handle matrices over ZZ specially -- t...
- 11:33 Slug #691: Matrix determinant over ZZ
- Just as a speed comparison reference I computed @3^(3^17)@ on both machines:
* old G4 took about 50s (on battery pow... - 11:22 Slug #691: Matrix determinant over ZZ
- I've just tried a 1000x1000 matrix: the old G4 took about 550s, my newer MacBook Pro took 1400s. Embarrassing!
*NOT... - 10:32 Slug #691: Matrix determinant over ZZ
- What?!? My dad's ancient iBook G4 is just as fast as my much newer MacBook Pro???
Something must be seriously wro... - 10:31 Slug #691 (Closed): Matrix determinant over ZZ
- I tried computing the following:...
23 Apr 2015
- 19:12 Feature #690: Fault tolerant rational reconstruction: implement simultaneous version
- What exactly should the interface be?
Who does the Chinese remaindering?
Which single rational reconstructor shou... - 19:10 Feature #690 (New): Fault tolerant rational reconstruction: implement simultaneous version
- Implement the algorithm for simultaneously reconstructing several rational numbers.
- 19:09 Feature #689: Fault tolerant rational reconstruction: make bad factor publicly accessible
- Suggested name of the new fn is @BadMFactor@; other candidates?
- 19:07 Feature #689 (Closed): Fault tolerant rational reconstruction: make bad factor publicly accessible
- In @RatReconstructByContFrac@ the bad factor of the combined modulus is computed; make it publicly accessible
22 Apr 2015
- 14:38 Slug #688: PolyAlgebraHom (PolyRingHom) evaluate multivariate polynomials
- I thought that it could be improved using geobuckets, so I searched the actual code performing the computation.
It i... - 13:53 Slug #688: PolyAlgebraHom (PolyRingHom) evaluate multivariate polynomials
- We found this slug while workig on @Implicit@ (evaluation for checking the final output can be very slow)
- 13:52 Slug #688 (New): PolyAlgebraHom (PolyRingHom) evaluate multivariate polynomials
- Application of PolyAlgebraHom can be unreasonably slow (this is indeed a problem in optimizing multivariate evaluation)
20 Apr 2015
- 13:21 Design #686 (New): myAddMul in poly rings
- 13:17 Design #686 (In Progress): myAddMul in poly rings
- Better names:
* *@myMoveLMToFront@*
* *@myMoveLMToBack@*
* *@myAddMulLM@*
- 11:59 Design #686: myAddMul in poly rings
- John Abbott wrote:
> Mario Albert calls @myAddMul@ in a "bad" way in @TmpJBEnv.C:323@.
> From his comments it seems... - 12:34 Bug #631: Ambiguous: rank for matrix (in ex-matrix1.C)
- Renaming is done now. Isn't it?
- 10:26 Feature #658: Indets actually in a poly (or vector or matrix)
- also related to #91
19 Apr 2015
- 18:17 Feature #658: Indets actually in a poly (or vector or matrix)
- I am still undecided about the "return" value (and its type):
* *A* a list of integer indices (presumably of type @ve...
17 Apr 2015
- 18:32 Feature #658: Indets actually in a poly (or vector or matrix)
- I have impl'ed a first version (simple rather than efficient).
Not yet checked in; I want to do some testing first.
- 18:27 Design #686: myAddMul in poly rings
- Mario Albert calls @myAddMul@ in a "bad" way in @TmpJBEnv.C:323@.
From his comments it seems he wants to do:... - 18:25 Design #686: myAddMul in poly rings
- I have just added a check that the first arg must be non-zero (o/w LM does not exist).
Should it be an error or a @C... - 18:20 Design #686 (New): myAddMul in poly rings
- The mem fn @SparsePolyRingBase::myAddMul@ has strange semantics; the only documentation is a 1 line comment in the so...
16 Apr 2015
- 12:52 Feature #685: Use DivMask inside QBGenerator
- We shall need collections of @DivMask@ mirroring the elements of @myCornerList@ and @myAvoidList@. A complication ar...
- 12:44 Feature #685 (New): Use DivMask inside QBGenerator
- Internally @QBGenerator@ usually makes very many divisibility tests; use @DivMask@ to make these tests faster.
Thi...
15 Apr 2015
- 20:22 Design #683 (In Progress): Module index component in internal compressed representation
- Is there a @MaxExp@ function? At least one @PPMonoid@ has no upper limit on exponents; what value should be used in ...
- 20:15 Bug #232: No test for QBGenerator
- Just to wake up this thread as I have modified @QBGenerator@ lately.
Does anyone actually need @myNewCorner@ list?...
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).
- 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... - 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... - 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... - 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",... - 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 ... - 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 ...
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...
- 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... - 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.
- 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... - 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...
- 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 ...
- 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... - 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@.
...
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....
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... - 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...
- 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.
Also available in: Atom