Waldek Hebisch writes:
> Martin Rubey wrote:
>> currently seriesSolve uses a power series Ansatz of the form
>>
>> f(x) = f_0 + f_1 x + ... + f_k x^k + \sum_{n>k} a x^n
>>
>> (assuming that f_0, f_1, ..., f_k are already known) and solves for a.
>> This works surprisingly well, but of course no
Martin Rubey wrote:
> currently seriesSolve uses a power series Ansatz of the form
>
> f(x) = f_0 + f_1 x + ... + f_k x^k + \sum_{n>k} a x^n
>
> (assuming that f_0, f_1, ..., f_k are already known) and solves for a.
> This works surprisingly well, but of course not always.
>
> The patch attached
Waldek Hebisch writes:
> BTW: I wonder how many systems have polynomials as general as
> SparseUnivariatePolynomial -- I think that in most systems
> 'x^(10^100)' would fail.
I just noticed that in sage one has to use an option:
sage: R. = PolynomialRing(QQ, sparse=True); R
Sparse Univariate Po
currently seriesSolve uses a power series Ansatz of the form
f(x) = f_0 + f_1 x + ... + f_k x^k + \sum_{n>k} a x^n
(assuming that f_0, f_1, ..., f_k are already known) and solves for a.
This works surprisingly well, but of course not always.
The patch attached fixes this, please give OK to commi
