Anonymous | Login | Signup for a new account | 2025-04-19 20:27 MSK |
Main | My View | View Issues | Change Log | Roadmap | Docs |
Viewing Issue Simple Details [ Jump to Notes ] | [ View Advanced ] [ Issue History ] [ Print ] | ||||||
ID | Category | Severity | Reproducibility | Date Submitted | Last Update | ||
0000052 | [ALGLIB] Fast transforms | feature | N/A | 2009-05-18 12:21 | 2009-07-27 14:22 | ||
Reporter | SergeyB | View Status | public | ||||
Assigned To | SergeyB | ||||||
Priority | normal | Resolution | implemented | ||||
Status | resolved | Product Version | |||||
Summary | 0000052: IMPLEMENTED: complex FFT for general N (composite/prime) | ||||||
Description |
Transforms implemented: * forward, complex * backward, complex N's supported - arbitrary: * composite N's are handled with Cooley-Tukey algorithm * small prime-factors are handled with built-in codelets * large prime-factors are handled with Bluestein's algorithm Complexity: N*log(N) for composite/prime N's. |
||||||
Additional Information | |||||||
Programming language | Unspecified | ||||||
Attached Files | |||||||
|
There are no notes attached to this issue. |
Mantis 1.1.6[^] Copyright © 2000 - 2008 Mantis Group |