Cyclotomic polynomial: Difference between revisions
m
→Another approach
m (→{{header|J}}) |
|||
Line 2,171:
roundreal =: [: <. 0.5 + 9&o.</lang>
This variation for polynomial division is only valid when there's no remainder to be concerned with (which is the case, here). The article mentioned in the comments is an essay on using [[j:Essays/FFT|fft for polynomial multiplication]]
This approach gave slightly over a 16x speedup for <tt>taskorder 10</tt>, from a 2 element cache, with an approximately 50% increased memory footprint. (Remember, of course, that benchmarks and benchmark ratios have dependencies on computer architecture and language implementation, and the host environment.)
| |||