summary |
shortlog | log |
commit |
commitdiff |
tree
first ⋅ prev ⋅ next
Antonio Jimenez Pastor [Mon, 25 Jun 2018 14:58:57 +0000 (16:58 +0200)]
Modified the method to decide parents for the example functions
Started to add the method to compute polynomials directly (Not finished)
Antonio Jimenez Pastor [Tue, 19 Jun 2018 10:20:23 +0000 (12:20 +0200)]
Deleted a print line in the method random_element in the class DDRing
Antonio Jimenez Pastor [Tue, 19 Jun 2018 09:53:29 +0000 (11:53 +0200)]
Fixed error in method random_element in class DDRing
Antonio Jimenez Pastor [Tue, 19 Jun 2018 09:36:31 +0000 (11:36 +0200)]
Added the method random_element to the class ddRing
Antonio Jimenez Pastor [Tue, 19 Jun 2018 09:29:26 +0000 (11:29 +0200)]
Revert "Added the method random_element to the class DDRing"
This reverts commit
ac3682813da3e9400fd19d5e13d2d6ca2e7d557b.
Antonio Jimenez Pastor [Tue, 19 Jun 2018 09:24:34 +0000 (11:24 +0200)]
Added the method random_element to the class DDRing
Antonio Jimenez Pastor [Mon, 18 Jun 2018 14:44:38 +0000 (16:44 +0200)]
Adapted files of package misc to Python.
Other deprecated files (i.e., never used) were deleted.
Files adapted: bareiss.py, matrix.py, ring_w_sequence.py, verbose.py
Files deleted: euclidean.py, hermite.py, nullspace_wrapper.py,
storj_villard.py, timing.py
Antonio Jimenez Pastor [Mon, 18 Jun 2018 07:59:25 +0000 (09:59 +0200)]
Final version after visit to Paris
Antonio Jimenez Pastor [Wed, 13 Jun 2018 11:45:01 +0000 (13:45 +0200)]
Performance improvements
1 - The method for computing the root of the indicial polynomial now is cached.
This means that operators with the same indicial polynomial take less time to
compute their roots.
2 - Computing th roots of the indicial polynomial when there are parameters is done
using a modular approximation: we evaluate the parameters and when the polynomial
has the same degree we compute the roots of a univariate polynomial. That is a superset
of the roots we want, so we check and we keep those that were roots for the indicial polynomial.
Minor changes:
matrix.py now use the method is_Matrix instead of sage.matrix.Matrix (deprecated in
SAGE: https://trac.sagemath.org/ticket/24096
Antonio Jimenez Pastor [Thu, 19 Apr 2018 17:30:12 +0000 (19:30 +0200)]
Added the README file to the repository.
No changes within the code.
Antonio Jimenez Pastor [Wed, 18 Apr 2018 10:44:38 +0000 (12:44 +0200)]
Added an heuristic zero testing for Lazy Elements.
Now, before going to the real value, it checks that the initial value of
the lazy element at zero is zero. Otherwise, the method is_zero
of the class _LazyElement returns directly False
Antonio Jimenez Pastor [Fri, 9 Mar 2018 14:03:55 +0000 (15:03 +0100)]
New version of the packages.
Now the class DDRing accepts algebraic extensions of QQ as
basic field. Also, this field is dinamicall computed assuming
that, if the base ring is a Polynomial Ring, the base field
is the same as the coefficients of the polynomials.
Antonio Jimenez Pastor [Thu, 8 Mar 2018 13:43:58 +0000 (14:43 +0100)]
some version
Antonio Jimenez Pastor [Thu, 8 Mar 2018 10:39:24 +0000 (11:39 +0100)]
Setting up the public repository for the SAGE implementation Differentially Definable Functions.