Optimize geometric-domain Lagrange evaluation - #116
Closed
odraccir1 wants to merge 5 commits into
Closed
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Add reusable linear-time barycentric precomputation to geometric_sequence_domain.
For a domain of size (m):
Construction takes (O(m)) field operations and one field inversion.
Evaluating all Lagrange weights at one point takes (O(m)) operations and one inversion.
Evaluating at (k) points takes (O(mk)) after domain construction.
The PR also includes
batch_inverse which is needed for the algorithm.
calculation of vanishing polynomial in linear time using the recurrence relation from the Gaussian-Binomial theorem
Related to #113