Optimize nmod_mat_lu_classical_delayed#2640
Merged
fredrik-johansson merged 2 commits intoflintlib:mainfrom Apr 21, 2026
Merged
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
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.
Applies the same optimizations as #2637 to classical Gaussian elimination for
nmod_mat, and adjusts the algorithm selection innmod_mat_lu. This mainly speeds up linear algebra up to dimension about 100, though for some small moduli there is a decent speedup up to dimension about 1000.Nearly-optimal cutoffs between classical and recursive LU have been brute-forced for each bit size with and without
--with-blas. Very large threshold values (some over 1400) indicate that matrix multiplication is poorly optimized.Speedup for
nmod_mat_lu, without BLAS:Speedup for
nmod_mat_lu, with BLAS: