搜索资源列表
算法(strassen和strassen混合算法)
- strassen算法的扩展，可以计算任何偶数阶矩阵的相乘，一般strassen只能计算2的n次方阶（自己编写，英文注释~）-Strassen expansion algorithm can even order any calculation of matrix multiplication, general Strassen only two terms of the n-th-order (to prepare themselves
strassen
- 传统方法与Strassen算法相结合的矩阵相乘算法，可以求出任意两个偶数阶矩阵的乘积！本代码简单,精简，非常好！非常巧妙！没用到什么复杂的东西！经测试完全正确！-Strassen with traditional methods based on the combination of matrix multiplication algorithm, can be obtained even arbitrary two-matrix pr
strassen
- strassen矩阵算法以及效率分析
strassen
- 使用strassen演算法來計算矩陣乘法，輸入矩陣大小，須為2的次方，程式會產生一矩陣於螢幕上和檔案C:\\\\matrix_1.txt，其產生的結果為2次方邊長的方陣，並按數字編排，同乘自己一次產生的結果
strassen矩阵相乘
- 算法分析实验报告：Strassen矩阵乘法，无问题-algorithm analysis experiment : Strassen matrix multiplication, no problem
Strassen11
- 矩阵相乘的Strassen算法，其中 乘积矩阵C = H*H，H =（hij）n*n 1. hij = ， i，j=1，…8 2. i，j=1，…12 矩阵H =（hij）n*n自动生成，取小数点后面6位计算 -Strassen matrix multiplication, the algorithm, the product matrix C = H* H, H = (hij) n* n 1. hij =, i,
strassen555
- 1． 用任何一种高级开发语言编程实现矩阵相乘的Strassen算法。 2． 分析其时间复杂度。 3． Strassen算法与传统算法其优点与不足之处。 -1. Any development of a high-language programming matrix multiplication, the algorithm Strassen. 2. Analysis of their time complexity. 3.
test
- 算法设计与分析实验，Strassen矩阵乘法，java实现，输入矩阵阶数后由系统自动生成两个矩阵，然后用Strassen方法，和普通方法分别计算乘法结果-Experimental Design and Analysis of Algorithms, Strassen matrix multiplication, java realized, input matrix order automatically generated by th
Strassen
- 矩阵乘法是线性代数中最常见的运算之一，它在数值计算中有广泛的应用。若A和B是2个n×n的矩阵，则它们的乘积C=AB同样是一个n×n的矩阵。-Linear algebra matrix multiplication is the most common computing one of its numerical computation in a wide range of applications. If A and B are two
sxjc
- 应用加密算法和认证技术 实验：Solovag-Strassen算法、Lehmann算法和Rabin-Miller算法的素性检测的原理与测试过程。-Application of encryption algorithms and authentication technology experiment: Solovag-Strassen algorithm, Lehmann algorithm and Rabin-Miller prima
Algorithm
- 各种矩阵相称的算法时间比较，有MATLAB自带矩阵，分制法，循环计算，Strassen算法-Commensurate with the various matrix algorithm time, there MATLAB own matrix, a scoring system, cyclic calculation, Strassen algorithm
1
- STRASSEN矩阵乘法算法 ，实现矩阵运算-Strassen matrix multiplication algorithm, the realization of matrix operations
strassen
- 运用strassen算法，计算矩阵计算的值，并将其值输出，是一种基本算法-Strassen algorithm to use to calculate the value of the matrix calculation and the value of output, is a basic algorithm
strassen
- 2*2的strassen算法，可以根据自己的血药把它升级为n阶矩阵相乘。这里只是2*2而已-2* 2 strassen algorithm, based on their own blood to upgrade it for n-order matrices. Here it is 2* 2
suxingjiance
- 素性检测，利用三种方法： Solovag-Strassen检测，Lehmam检测， Rabin-Miller检测-Primality testing, using three methods: Solovag-Strassen Detection, Lehmam testing, Rabin-Miller Detection
ALGO-08
- strassen matrix mutliplication based on the combination of matrix multiplication algorithm for a 4 by 4 matrices-strassen matrix mutliplication based on the combination of matrix multiplication algorithm for a 4 by
Strassen
- Multiplicaciion matrices n * n-Multiplicaciion matrices n* n
capi-0.21
- CAPI多核编程算法库0.21版，里面有分布式队列、分布式查找、分布式内存管理、任务图调度、动态任务调度等多种容器，新增了CWaitTaskScheduler任务调度容器和并行Strassen矩阵乘法等。-CAPI programming algorithm for multi-core library version 0.21, which are distributed queue, distributed search, dist
123
- Strassen 算法 用C++实现并且把矩阵看作一个类-Strassen algorithm using C++ implementation and the matrix as a class
strassen
- 矩阵乘法是线性代数运算中最常见的运算,它在科学研究以及工程开发中都具有举足轻重的作用,提高其运算的效率是很多大型的学术研究中的内容,这边论文是分析主要的两个矩阵乘法算法.-Linear algebra matrix multiplication is the most common operation, it is in scientific research and engineering development have a dec