New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
subresultants_pg_amv.py contains functions for computing #10374
Conversation
(a) euclidean/sturmian sequences in Q[x] and Z[x], (b) subresultant polynomial sequences It does NOT use the function prem which "messes up" the signs in the euclidean/sturmian sequences. Instead it uses rem and remZ.
(a) euclidean/sturmian sequences in Q[x] and Z[x], (b) subresultant polynomial remainder sequences It does NOT use the function prem which "messes up" the signs in the euclidean/sturmian sequences. Instead it uses rem and remZ.
added new function final_touches for the Van Vleck method
as well as several other changes final_touches and other minor changes to various functions
The Travis tests are failing because of code quality. You can run |
the statement <from sympy import *> and removed some end of lines at the end of the file.
The Travis tests were complaining about the stmt from sympy import *, Quoting Aaron Meurer notifications@github.com:
|
everything worked out fine the 4th time. Quoting Aaron Meurer notifications@github.com:
|
correctly print 2x2 sylvester2 matrices
to correctly print the final matrix s2
uniformity of code and better readability
It wants you to import things manually like |
of the file; also chnaged the oder of a statement in subresultants_vv
I did it; now that I have the whole package working will let you know when I am done. Quoting Aaron Meurer notifications@github.com:
|
with LC(p) < 0, and slightly modified the docstring 2. slightly altered code + docstring of modified_subresultants_amv(p,q,x) 3. slightly altered the docstring of sturm_pg(p, q, x, method=0) 4. same for sturm_amv(p, q, x, method=0) 5. slightly altered code + docstring of subresultants_pg(p,q,x)
After today's changes I think I am done! Let me know if there is Quoting Aaron Meurer notifications@github.com:
|
@jksuom do you have any thoughts on this? |
I believe the algorithms are useful. Some modifications would be needed: The file should probably be moved to polys. Its name should be changed, preferably to indicate that the algorithms are for polynomials with integer and rational coefficients. Test file should be created. I expect that to be the bulk of the remaining task. |
Very good points both of them. Regarding the name of the Maybe subresultants_qq_zz is better. Any better suggestions? I will also add some comments for the module as a whole. As for the test file, it would help me a lot if I could see one. Quoting Kalevi Suominen notifications@github.com:
|
Take a look at the files in the various
where "some_func" is the function you are testing. You can then run the tests with
|
…it to polys. Also have created the test file test_subresultants_qq_zz.py and moved it to polys/tests
Thank you. Very helpful. I did it and passed the travis test. Quoting Aaron Meurer notifications@github.com:
|
Thank you. That was quick. This looks good to me. |
I think this is ready. Thank you for your work. |
subresultants_pg_amv.py contains functions for computing
It was a great pleasure and I learned a lot! Quoting Kalevi Suominen notifications@github.com:
|
@akritas can you add something to https://github.com/sympy/sympy/wiki/Release-Notes-for-1.0 about this |
done |
(a) euclidean/sturmian sequences in Q[x] and Z[x],
(b) subresultant polynomial sequences
It does NOT use the function prem which "messes up" the signs
in the euclidean/sturmian sequences. Instead it uses rem and remZ.