[sympy] Re: GSoC 2018: Numerical Evaluation of Linear Recurrences

I have started a [wiki page](https://github.com/sidhantnagpal/gsoc/wiki/GSoC-2018-Application-Sidhant-Nagpal:-Transforms,-Convolution-&-Linear-Recurrence-Evaluation) describing the details of my project. It would be great if I can get feedback for the same. Thanks. -- You received this

[sympy] Re: GSoC 2018: Numerical Evaluation of Linear Recurrences

> Interesting that you should mention this. See the recent thread here > where I ask > if there is a better way to compute such things (at least to a novice it > appears that we are talking about the same thing). > Yes, indeed it is

[sympy] Re: GSoC 2018: Numerical Evaluation of Linear Recurrences

Interesting that you should mention this. See the recent thread here where I ask if there is a better way to compute such things (at least to a novice it appears that we are talking about the same thing). On Thursday, February 15,

Re: [sympy] Re: GSoC 2018: Numerical Evaluation of Linear Recurrences

Yes, you can create a wiki page for your proposal and start writing the proposal there. moorepants.info +01 530-601-9791 On Mon, Feb 19, 2018 at 7:10 AM, Sidhant Nagpal wrote: > *References to Topics:* > Cayley Hamilton Theorem & Evaluation of Homgeneous Linear

[sympy] Re: GSoC 2018: Numerical Evaluation of Linear Recurrences

*References to Topics:* Cayley Hamilton Theorem & Evaluation of Homgeneous Linear Recurrences Convolution & Transformation Modules *Query:* Can I start describing my project details on GSoC

[sympy] Re: GSoC 2018: Numerical Evaluation of Linear Recurrences

*Reference to Related Topics:* Cayley Hamilton Theorem & Evaluation of Homogeneous Linear Recurrences Convolution and Transformation Modules *Query:* Can I start describing my

[sympy] Re: GSoC 2018: Numerical Evaluation of Linear Recurrences

Additional Note: Implementing this would require knowledge of Number Theoretic Transform to solve it optimally in O(k*lg(k)*lg(k) + k*lg(k)*lg(n)) for prime fields. Although there is a simpler sub-optimal solution which can solve this in O(k*k*lg(n)). Generalising for other