Added Freivalds' Algorithm for randomized matrix multiplication verification #6340
+105
−0
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
aditya-7562
requested review from
DenizAltunkapan,
yanglbme,
vil02,
BamaCharanChhandogi,
alxkm and
siriak
as code owners
Codecov ReportAll modified and coverable lines are covered by tests ✅
Additional details and impacted files@@ Coverage Diff @@
## master #6340 +/- ##
============================================
+ Coverage 74.33% 74.37% +0.04%
- Complexity 5392 5403 +11
============================================
Files 679 680 +1
Lines 18820 18842 +22
Branches 3646 3656 +10
============================================
+ Hits 13990 14014 +24
+ Misses 4274 4273 -1
+ Partials 556 555 -1 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
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.
Summary
Added Freivalds' Algorithm under the
randomizedcategory as part of issue [#6219]This algorithm offers a fast, probabilistic method to verify whether matrix multiplication
A × B = Cholds true, avoiding full recomputation of the product.🧠 Randomized Algorithm Approach
rA × (B × r) ≟ C × rktimes to reduce the probability of error⏱ Time Complexity
(significantly faster than recomputing A × B, which is O(n³))
✅ Use Cases
📋 Checklist
CONTRIBUTING.mdclang-format -i --style=file path/to/your/file.java