搜索资源列表
算法(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, English Notes ~)
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, j = 1, ... 2. i, j = 1, ...
strassen
- 传统方法与Strassen算法相结合的矩阵相乘算法，可以求出任意两个偶数阶矩阵的乘积！本代码简单,精简，非常好！非常巧妙！没用到什么复杂的东西！经测试完全正确！-Strassen with traditional methods based on the combination of matrix multiplication algorithm, can be obtained even arbitrary two-matrix product! The code simple, concis
test
- 算法设计与分析实验，Strassen矩阵乘法，java实现，输入矩阵阶数后由系统自动生成两个矩阵，然后用Strassen方法，和普通方法分别计算乘法结果
Strassen
- 矩阵乘法是线性代数中最常见的运算之一，它在数值计算中有广泛的应用。若A和B是2个n×n的矩阵，则它们的乘积C=AB同样是一个n×n的矩阵。
Strassen
- 调用随机函数输入2个矩阵，并用Strassen矩阵乘法和普通的矩阵乘法计算2个矩阵的乘积，并且记录程序运行时间作比较。 -Call the random function input 2 matrix, and matrix multiplication and Strassen matrix multiplication calculation ordinary matrix product of two, and run-time recording procedures for com
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 4 matrices
capi-0.21
- CAPI多核编程算法库0.21版，里面有分布式队列、分布式查找、分布式内存管理、任务图调度、动态任务调度等多种容器，新增了CWaitTaskScheduler任务调度容器和并行Strassen矩阵乘法等。-CAPI programming algorithm for multi-core library version 0.21, which are distributed queue, distributed search, distributed memory management, tas
strassen
- 矩阵相乘的Strassen 算法及时间复杂性分析-failed to translate
Matrix
- Program includes class "macierz" (pl. matrix) with parallel multiply which uses open mp. It s simple multiply, not for example Strassen method.
Strassen3
- 本程序实现的两个矩阵的strassen乘法。为了对比还有传统矩阵乘法，和两种算法的运行时间。-The program realization of the multiplication of two matrices strassen. For comparison, traditional matrix multiplication, and the running time of two algorithms.
Strassen
- 矩阵乘法分治法实现。。C-Divide and conquer matrix multiplication implementation. . C++. . . . .
strassen
- 用strassen算法实现任意阶矩阵的乘法-strassen
strassen
- strassen乘法矩阵，很好解决你们所遇到任何情况-strassen matrix multiplication, a good solution to any situation you encounter
Strassen
- 利用Strassen算法求2^n维随机数组乘法。-Strassen algorithm for the use of 2 ^ n-dimensional random array multiplication.
Strassen
- 这是我自己写的一个实现Strassen的算法，方便简单，容易看懂，上手快，但是好像算法的时间要到很大才比普通算法快-I wrote an implementation of Strassen algorithm, convenient and simple, easy to understand, and the grassland, but it seems that the time of the algorithm to be great only faster than the ordi
strassen
- Strassen要求阶n是2的幂，但这样的情况很少。对任一偶数n，总有 n=m*2k, 将矩阵分为m*m个的2k阶矩阵。小矩阵用Strassen相乘，大矩阵用传统算法。设计出偶数阶矩阵相乘的算法。 -Strassen requires order n is a power of 2, but this situation is seldom. On either an even number n, out of a total of n = m* 2k, the matrix is R
strassen
- Java实现Strassen大矩阵乘法，内有说明文档-Big Java implementation Strassen matrix multiplication, there are documented
Strassen
- 我用C语言写的一个strassen矩阵相乘算法。-I use C language to write a matrix multiplication algorithm strassen
Strassen
- 在VS编写的Strassen算法代码，有注释，比较容易懂-VS Strassen algorithm written in code, annotated, it is easier to understand