FFT Multiplication
Project description
FFT Multiplication
Author: Moin Khan
FFT Multiplication: An implementation of the Fast Fourier Transform (FFT) algorithm to multiply two polynomials efficiently.
Introduction
FFT Multiplication
is a simple, zero-configuration command-line static HTTP server.
Installation:
Globally via pip
pip install fft_multiplication
This will install fft_multiplication
globally so that it can be imported into any python program.
Usage:
from fft_multiplication import multiply
p = [1, 1]
q = [1, 0]
print(multiply(p, q))
Features
- Efficient polynomial multiplication using the Fast Fourier Transform (FFT) algorithm
- Comparison with the direct multiplication method
- Test cases to ensure correctness of the implementations
Requirements
Python 3.x
Contributing
All contributions are welcome. Please create an issue first for any feature request or bug. Then fork the repository, create a branch and make any changes to fix the bug or add the feature and create a pull request. That's it! Thanks!
License
fft_multiplication is released under the MIT License. Check out the full license here.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for fft_multiplication-0.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | a8575c58139f286e2b30418465db47bb6a438c4e6e1108ba0dfe1d4a6fe30928 |
|
MD5 | 6430156764f213f38d453508b38e25a2 |
|
BLAKE2b-256 | f718f76dc8fc7264869476da9d532a952cef2bc29971413910cc447fd668d6e7 |