https://github.com/kzaky/threaded-implementation-of-berkowitz-s-algorithm

In this implementation, we are going to implement Berkowitz’s parallel algorithm for comput- ing the characteristic polynomial of a matrix. Berkowitz’s algorithm, is the fastest known parallel algorithm for computing the characteristic polynomial of a matrix. For the sake of simplicity we assume that the matrices are over {0,1}, i.e., the two field elements, where plus is XOR and multiplication is AND. The algorithm was designed such that the process takes no more than log2 n sequentially many steps. The program was then rigorously tested to ensure its accuracy.
https://github.com/kzaky/threaded-implementation-of-berkowitz-s-algorithm

Last synced: about 2 months ago
JSON representation

In this implementation, we are going to implement Berkowitz’s parallel algorithm for comput- ing the characteristic polynomial of a matrix. Berkowitz’s algorithm, is the fastest known parallel algorithm for computing the characteristic polynomial of a matrix. For the sake of simplicity we assume that the matrices are over {0,1}, i.e., the two field elements, where plus is XOR and multiplication is AND. The algorithm was designed such that the process takes no more than log2 n sequentially many steps. The program was then rigorously tested to ensure its accuracy.

• Host: GitHub
• URL: https://github.com/kzaky/threaded-implementation-of-berkowitz-s-algorithm
• Owner: kzaky
• Created: 2013-04-11T18:52:44.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2013-04-11T18:58:27.000Z (over 11 years ago)
• Last Synced: 2023-04-08T08:07:42.967Z (almost 2 years ago)
• Language: Python
• Size: 426 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:

Awesome Lists containing this project