[
https://issues.apache.org/jira/browse/MATH-745?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13206824#comment-13206824
]
Sébastien Brisard commented on MATH-745:
----------------------------------------
I worry about the exact same issue. Leandro, please test very large data sets.
If memory becomes an issue, we could have *two* implementations of the FFT, one
being less robust than the other (I would certainly not discard a 5x speed
up...).
> up to 5x Performance Improvement on FasFourierTransformer.java by using a
> recursive iterative sumation Approach
> ---------------------------------------------------------------------------------------------------------------
>
> Key: MATH-745
> URL: https://issues.apache.org/jira/browse/MATH-745
> Project: Commons Math
> Issue Type: Improvement
> Affects Versions: 3.0
> Reporter: Leandro Ariel Pezzente
> Labels: FFT, Fast, Fourier, Transform
> Attachments: FastFourierTransformer.patch.txt
>
>
> By swithinch form a loop iterative approach to a recursive iterative approach
> on fastFourierTransformer.java a Perfomance Improvement of up to 5x is gained.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
