| Anonymous | Login | Signup for a new account | 2025-10-30 19:14 MSK |
| Main | My View | View Issues | Change Log | Roadmap | Docs |
| Viewing Issue Advanced Details [ Jump to Notes ] | [ View Simple ] [ Issue History ] [ Print ] | ||||||
| ID | Category | Severity | Reproducibility | Date Submitted | Last Update | ||
| 0000061 | [ALGLIB] Fast transforms | feature | N/A | 2009-05-29 14:31 | 2009-07-27 14:22 | ||
| Reporter | SergeyB | View Status | public | ||||
| Assigned To | SergeyB | ||||||
| Priority | normal | Resolution | implemented | Platform | |||
| Status | resolved | OS | |||||
| Projection | none | OS Version | |||||
| ETA | none | Fixed in Version | 2.1.0 | Product Version | |||
| Target Version | 2.1.0 | Product Build | |||||
| Summary | 0000061: IMPLEMENTED: real FFT for general N (composite/prime) | ||||||
| Description |
Transforms implemented: * forward, real * backward, real N's supported - arbitrary: * even-sized tasks are solved using efficient reduction to complex FFT with factor of two savings * odd-sized tasks are solved using straightforward reduction to complex FFT (factor of two inefficient) Complexity: N*log(N) for composite/prime N's |
||||||
| Steps To Reproduce | |||||||
| Additional Information | |||||||
| Programming language | Unspecified | ||||||
| Attached Files | |||||||
|
|
|||||||
| There are no notes attached to this issue. |
| Mantis 1.1.6[^] Copyright © 2000 - 2008 Mantis Group |