I’m no expert, but looks like you can represent chebyshev polynomials as the determinant of a square matrix, and if they’re all the same size then multiplying the polynomials should be equivalent to multiplying the matrices and taking the determinant afterwards. Given that the matrices follow a very predictable form, this should also be pretty hardware performant I think.
Just some quick thoughts though :)
https://en.wikipedia.org/wiki/Chebyshev_polynomials?wprov=sf...