Activity
From 18 Mar 2018 to 16 Apr 2018
06 Apr 2018
-
20:54 CoCoALib Design #1179: Clean up SparsePolyOps-MonomialIdeals
- converted code for *@PrimaryDecomposition_MonId@* into a member function.
-
- Now that we have made some decisions about the design for ideals of some special sort, clean up *@SparsePolyOps-Monom...
-
- Created stucture.
Translated the uppermost function.
-
- Translate the code from the CoCoAPackage @PrimaryDecomposition0.cpkg5@ into CoCoALib
-
- Now we have...
-
- Use of a prefix is a convenient way to mimick subdirectories.
05 Apr 2018
-
15:11 CoCoALib Feature #1176: interval arithmetic
- There is an interval arithmetic sublibrary in the BOOST distribution.
The problem with depending on an external libr... -
- Implement interval arithmetic (for intervals with rational end points).
Some software libraries already implement ... -
- I suggest a function with the following semantics:
* call *RealRootsSmallValue(f, eps)*
* result is a list of close... -
- It is not as simple as I first thought. While the first order approximation I mentioned in comment 3 is correct, it ...
-
09:29 CoCoA-5 Support #1175 (New): intersection
- The intersection of MODULEs need to be exported.
-
- How to have a function that says in which package is in the input?
Why does not describe have this feature?!
*202...
04 Apr 2018
-
-
- Fixed @GPolyList EmbedVectorList(const VectorList& theVL, const GRingInfo& theGRI, const long StartingFromCompIndex)@...
-
- The problem is actually in @GBasis(M)@ when gens(M) contains a 0 element.
Fixing...
-
- which package?
-
- In case of type MODULE there is:
J := submodule(ModuleOf(X), WithoutNth(L,I));
but it does not allow to v... -
- A while ago I read an article about this (perhaps "evaluating a polynomial over an interval"?). I no longer recall m...
-
- Write a function which accepts a (univariate) polynomial *f* (with rational coeffs), and an interval *[a,b]* with rat...
-
- One can estimate the "stability" of the root by computing the value of the derivative at that root. By Taylor expans...
03 Apr 2018
-
- It seems that actually the problem is in the instability of the roots: the approximate root is probably close to the ...
-
- I found this bug while debugging @ApproxSolve@.
I had noticed that, when the answer was wrong, it was just on the fi... -
- It seems that sometimes (very rarely) the first root given by @RealRoots@ is wrong...
-
- I have found the slug: I had activated the "clever idea" of testing for @IsProbPrim@ after a factor has been bound, *...
29 Mar 2018
-
- It is very convenient having it public :-) :-)
... but today I used it to set the radical/maximal/... flags at the... -
- Anna Maria Bigatti wrote:
> Suggested names for the functions modifying this:
> @ComputeAndSetIsPrime3@, @ComputeAn...
28 Mar 2018
-
- Consider the following:...
23 Mar 2018
-
- All 0-dimensional ideals (i.e. those in x,y,..), now take less than 1 second.
I have added (as John suggested) a tim... -
- (just to know, when testing)
All these examples in "c" have positive dimension.
All these examples in "x" are 0-dim... -
20 Mar 2018
19 Mar 2018
-
- John Abbott wrote:
> I am not so convinced of the utility of @RandomLinearForm(P,lo,hi)@, and suggest commenting it ... -
- I am not so convinced of the utility of @RandomLinearForm(P,lo,hi)@, and suggest commenting it out until we find a ge...
-
- Done.
*RandomLinearForm(P)* -- if coeff ring of P is F_p
*RandomLinearForm(P, n)* -- same as _RandomLinearForm(P, -... -
- Port @RandomLinearForm@ to CoCoALib
-
- Implemented in CoCoALib. See Feature #1169
Also available in: Atom