搜索资源列表
算法(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 ~)
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
strassen
- strassen矩阵算法以及效率分析
Strassen矩阵乘法算法 C++程序源码
- Strassen矩阵乘法算法 C++程序源码 V.Strassen在1969年发表了一个算法，将计算两个n阶方阵的乘积的时间复杂性降低到了o（nlog27），被誉为“在代数复杂性理论中最激动人心的结果”。该算法主要适用于方阵的乘法。-Strassen algorithm for matrix multiplication C++ program source V. Strassen published in 1969, an algorithm to compute the product of
solovay-strassen-primality-tes
- solovay-strassen素性测试法的matlab实现，这也是密码学中的常见算法,solovay-strassen primality test of matlab implementation, which is common cryptography algorithms
Algorithm
- 各种矩阵相称的算法时间比较，有MATLAB自带矩阵，分制法，循环计算，Strassen算法-Commensurate with the various matrix algorithm time, there MATLAB own matrix, a scoring system, cyclic calculation, Strassen algorithm
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
Strassen
- algorithme de multiplication suivant l algorithme de Strassen diviser pour regner pour exemplaire de taille n.
Strassen
- Strassen算法任意使用矩阵甚至。矩阵函数，就立即产生，并且计算算法的计算时间，使用计算器windos自己的时间，准确度高！-Strassen algorithm for calculating the arbitrary use of the matrix even. Matrix function has immediately generated, and the calculation algorithm of computing time, the use of calculato
strassen
- 设计编程实现矩阵相乘的Strassen算法，具体要求： （1）矩阵阶数n由用户输入（注意n非 2k 时的处理） （2）n阶矩阵A、B调用随机函数自动生成，限定矩阵元素在0-10之间 （3）输出A、B、C=A*B （4）请在实验报告中“程序设计（方案）说明部分”写明你如何实现矩阵划分、矩阵结果合并 （5）请在源代码中对主要函数功能、变量、语句进行注释 （6）请采用结构程序设计方法或面向对象程序设计方法，对各子功能用函数实现，不要一个主函数完成所有工作 -matrice
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
Strassen
- Example of the Strassen Algoritms.
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
strassen
- 矩阵乘法是线性代数运算中最常见的运算,它在科学研究以及工程开发中都具有举足轻重的作用,提高其运算的效率是很多大型的学术研究中的内容,这边论文是分析主要的两个矩阵乘法算法.-Linear algebra matrix multiplication is the most common operation, it is in scientific research and engineering development have a decisive role in raising the effi
Strassen
- strassen算法 visual studio 2008-strassen
strassen
- 1.实现时间复杂度为 Ο （nlg7） strassen矩阵乘法 2. 实现时间复杂度为 Ο(n3) 常规矩阵乘法 3. 能随机生成矩阵 4. 分析比较不同输入规模下的strassen算法与常规矩阵乘法的运行时间-1. To achieve the time complexity of Ο (nlg7) strassen matrix multiplication 2. To achieve the time complexity of Ο (n3) General matrix m
Matrix
- Program includes class "macierz" (pl. matrix) with parallel multiply which uses open mp. It s simple multiply, not for example Strassen method.
strassen
- 矩阵算法的strassen算法，利用此方法只需执行7次递归的矩阵乘法运算和标量次加法和减法运算。-Matrix algorithm strassen algorithms, using this method only 7 recursive implementation of matrix multiplication and scalar addition and subtraction computation times.