Now, I've also added the factor_minmult1 function [1]. However, I'm
having a doubt regarding how to implement try_factorization. I've
mentioned the input and output specifications of the routine in the file
itself, but am unsure about how Padé approximation should be used to
reconstruct the factor from the inputs. Here's what I've thought about
so far: First, in section 3.6 of the thesis, van Hoeij talks about
writing D^0,D^1,...,D^order_R as vectors in the vector space generated
by D^0,D^1,...,D^order_r. I think I can do that. This will generate a
list of lists (alternatively, vectors) of vectors in k((x)). How do I
proceed from there? Waldek, you mentioned before that guessHolo with
some modifications should work for this purpose. Could you please expand
on that a little?
[1]
https://github.com/fandango-/fricas/commit/bdb596caab2bd728bbf3bea4445f219b8f52b263
Thanks,
Abhinav.
On 07/08/2015 06:39 PM, Abhinav Baid wrote:
I've added documentation for the factor_* functions and their helpers.
Also, I've implemented same_charclass?, l_p and compute_bound [1]. Any
comments on these?
[1]
https://github.com/fandango-/fricas/commit/beb7a82fc4c442583dc0a41c328228616364f2d0
Thanks,
Abhinav.
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
