I will try to explain my problem thoroughly. I have an input vector F that could be thousands of elements long. For this example lets say F is [1,2,3,4,5].
I then have a function that generates polynomial coefficients out of element k in F. The function could be
[k^2, 5*k, k+2]
for F(1) the polynomial coefficients are [1^2, 5*1, 1+2] and for F(2) it's [2^2, 5*2, 2+2] and so on. This I can accomplish with a loop. After generating polynomial coefficients for all elements k in F, I have to multiply the corresponding polynomials all together. Think of it like (1 + 5x + 3x^2)*(4 + 10x + 4x^2)*...*(F(5)^2, F(5)*5, F(5) + 2). I thought a convolution loop might work here, but I feel like it's a bit too complex for me to make one. Remember that in this example the number of elements in F was 5, but it might as well be thousands.
Thankful for any help I might get.