I've seen the Mellin transform described as the "multiplicative" analogue to the Laplace transform, as well as the Fourier transform when $x\to\log y$.

Would a discrete Mellin transform be able to take advantage of any of the same optimizations that allow you to reduce the operations in a discrete Fourier transform?

  • $\begingroup$ Does this paper help? they seem to get an algorithm directly expressed in terms of FFT which goes in the way of your question. researchgate.net/publication/… $\endgroup$ – tibL Mar 31 '17 at 14:17

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.