In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2t real GFT(a,b) (a = ±1/2, b = 0 or b = ±1/2, a = 0) is 2t+1 – 2t - 2 and that for ...
Fourier analysis and numerical methods have long played a pivotal role in the solution of differential equations across science and engineering. By decomposing complex functions into sums of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback