Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use FFT algorithm for faster polynomial multiplication #46

Open
wants to merge 3 commits into
base: dev
Choose a base branch
from

Conversation

jonasvanderschaaf
Copy link

@jonasvanderschaaf jonasvanderschaaf commented Aug 5, 2021

This pull request will contain an implementation of the Cooley-Tukey Fast Fourier Transform algorithm, and use it to speed up polynomial multiplication for high degree polynomials. More information can be found in issue #45.

This pull request will contain the following features:

  • An implementation of the Fast Fourier Transform
  • A modification to the polynomial multiplication code to use this algorithm for high degree polynomial multiplication
  • Tests covering most vital functions to ensure proper functioning of multiplication
  • Benchmarking and optimizing the algorithm

Axect added a commit that referenced this pull request Feb 10, 2022
* Cholesky Decomposition (#46)
* Add `is_symmetric`
Axect added a commit that referenced this pull request Feb 10, 2022
* Implement Cholesky Decomposition (#46)
* Add `is_symmetric` method to Matrix
@Axect Axect marked this pull request as ready for review February 21, 2022 11:14
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants