Activity
From 23 Mar 2012 to 21 Apr 2012
20 Apr 2012
- 12:19 Feature #125: Matrix equation solving; linear system solving
- While speaking to Renzo about choosing the name, I realised that solving a linear system is slightly different from s...
- 11:56 Feature #107: Recognizing finite fields
- I really don't like the name @CardExp@ -- I think it is too cryptic.
The value it returns is log(cardinality)/log(... - 11:13 Bug #135 (Closed): Revise interface to SmallFpImpl & friends
- After starting work on the reimplementation of @DUPFF@ in C++, I discovered that the interface to @SmallFpImpl@ is ne...
19 Apr 2012
- 23:59 Feature #134 (New): Convenience ring ctors and homs
- Here are some ideas for convenient ring ctors which make homs too:
* change PPOrdering (makes new poly ring, and pro...
18 Apr 2012
- 22:22 Feature #107: Recognizing finite fields
- First impls have been made.
The cardinality is represented by a fn called @CardExp@ which gives the exponent of @p...
16 Apr 2012
- 15:50 Feature #40: Squarefree factorization - Alessio d'Ali`
- Alessio did numerous timing experiments to understand whether reordering the variables could lead to a useful gain in...
- 10:50 Feature #125: Matrix equation solving; linear system solving
- As mentioned in the previous post, currently I have used several fn names for solving linear systems: a generic fn, a...
- 10:45 Feature #125: Matrix equation solving; linear system solving
- What names should we use for the fns which find a solution to a linear system? The name may be related to the name f...
15 Apr 2012
- 22:07 Bug #130 (New): Design problem in ideals
- Now that there is a linear system solver I tried to write a general implementation for
@SparsePolyRingBase::IdealImp... - 21:59 Slug #129: Better GCD
- Implemented a first version where some GCD computations are passed to the old CoCoA-4 code. It is a poor implementat...
- 21:38 Slug #129 (New): Better GCD
- Currently CoCoALib computes GCDs using GBasis/syzygy computations. This is often terribly slow -- there is faster co...
13 Apr 2012
- 18:29 Feature #125: Matrix equation solving; linear system solving
- Added some doc in @MatrixArith.txt@, and a new test @test-matrix3.C@.
No new example program yet.
New fns not yet a... - 14:30 Feature #125: Matrix equation solving; linear system solving
- JAA has an impl of the generic case (over a field).
JAA has written a test for this first impl.
No example, and no ...
05 Apr 2012
- 14:27 Feature #127 (In Progress): Convert DUPFF code to C++
- Convert the old factorizer C code "DUPFF" into C++.
- 14:26 Feature #126 (New): New datastructures directory
- Create a new datastructures directory to hold source code for impls of various datastructures (e.g. the various Distr...
- 14:23 Feature #125 (In Progress): Matrix equation solving; linear system solving
- Add code for solving linear systems. There are several subcases:
* generic case over a field
* full rank and not f... - 14:12 Feature #124: change long args in matrices into MachineInt (?)
- The args being considered are "indices"; we should be consistent regarding all sorts of index (well, at least non-neg...
04 Apr 2012
- 15:20 Feature #124 (Rejected): change long args in matrices into MachineInt (?)
- For "public" functions (not member functions) like...
- 13:07 Feature #123 (New): IdealOfPoints with generic coeffs
- Think about the implementation of IdealOfPoints in the case of generic coefficients (_e.g._ in *@QQ(a)@*)
Implement ... - 09:37 Feature #122 (Closed): Porting "LinKer"
- This issue is *closed*; it is a *DUPLICATE* of #206
Port cocoa-4 C code about LinKer to cocoalib.
- 09:22 Feature #121 (Closed): Porting "IdealOfPoints"
- Port in cocoalib the cocoa-4 C code about BuchbergerMoeller.
An important step in it is the lifting from Fp --> QQ...
03 Apr 2012
- 21:48 Slug #120: LT over QQ: surprisingly slow
- My "noddy" program for computing GBases can do the whole computation in a few seconds...
- 21:08 Slug #120: LT over QQ: surprisingly slow
- Here is another suspect starting ideal in @QQ[x,y,z],Lex@
@[x^4 +x*y^2*z +y^4, x^3*y +x^2*z^2 +z^2]@
- 20:40 Slug #120 (New): LT over QQ: surprisingly slow
- The following should compute a LT ideal of a small ideal (using lex).
It takes longer than I would expect over QQ --... - 17:30 Bug #119 (Closed): CoCoA4io
- The file @CoCoA4io@ should not be inside CoCoALib -- it belongs in CoCoAServer.
Move it... will lead to some consequ...
02 Apr 2012
30 Mar 2012
- 19:09 Feature #116 (Closed): ordering matrices with rational coefficients
- it is useful to allow rational coefficients (why not?) and appropriate conversion into ZZ when necessary (optimized O...
- 14:36 Bug #22: Rename PPMonoidEvZZ?
- We have not yet decided about internal impl names.
JAA still likes his suggestion made two posts ago.
- 14:34 Bug #22: Rename PPMonoidEvZZ?
- We don't have time to complete this change before 0.9950.
However we have decided that it is simplest for the user... - 12:55 Support #75: Documentation review by Caleo
- Alessandra reports:
# the examples are mostly OK; she reported some minor problems which J+A attended to immediately...
26 Mar 2012
- 19:11 Bug #114 (In Progress): Ideals of polynomials
- Currently operations special to ideals in polynomial rings are located in @SparsePolyRing.H@ -- this seems incorrect....
23 Mar 2012
- 17:02 Feature #113 (In Progress): Introduce PartialHom
- Currently CoCoALib does not distinguish between proper homs and partial homs.
Thus we can create a (partial) RingH... - 12:39 Support #75: Documentation review by Caleo
- Alessandra reports:
* doc for almost all rings (except @ring@, @RingElem@) needs to be better organized
* reference... - 11:37 Support #112 (New): automatic creation of all function signatures
- Is it possible to create a readable collection of all function signatures and (more difficult) to link to the correct...
Also available in: Atom