搜索资源列表
1
- STRASSEN矩阵乘法算法 ，实现矩阵运算-Strassen matrix multiplication algorithm, the realization of matrix operations
Matrix
- 矩阵乘法计算器，实现两个矩阵的乘法。VC++6实现-Matrix multiplication calculator, the achievement of the two matrix multiplication. VC++6 to achieve
Strassen
- 利用C++实现strassen矩阵乘法，即采用七次乘法的分治法。-The use of C++ realization of Strassen matrix multiplication, namely multiplication seven sub-rule method.
nni
- 计算n阶矩阵的逆矩阵的函数，输入表示矩阵的指针和阶数，然后计算输出逆矩阵的指针，附带矩阵乘法检测结果-Calculation of n-order matrix inverse matrix function, enter the matrix express the pointer and order, and then calculating the inverse matrix of output indicators, with matrix multiplication test re
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
109201256Julia_parallel
- 矩阵乘法 OpenMP 并行计算器 见识到了 可大幅降低的课覅哦 大哭日俄-chengfa
Matrix_multiplication
- 实现矩阵乘法运算可以输入的矩阵,然后回在另外一个list中产生结果-Matrix_multiplication
goodringmatrix
- 用netbean编写的矩阵乘法和计算多个圆环面积之和-Netbean prepared using matrix multiplication and calculation of area and number of rings
matrix
- 矩阵运算简单运算（求转秩，乘法，矩阵求反）-operation with matrix(including transfer,multiply,reverse)
tt
- 算法设计与分析 习题部分解 比如：由于矩阵乘法满足结合律，所以计算矩阵的连乘可以有许多不同的计算次序。这种计算次序可以用加括号的方式来确定。 若一个矩阵连乘积的计算次序完全确定，也就是说该连乘积已完全加括号，则可以依此次序反复调用2个矩阵相乘的标准算法计算出矩阵连乘积 -Algorithm design and analysis of some solutions of exercises to meet the combination of matrix multiplicatio
Matrixmultiplication
- 矩阵乘法并行算法的MPI源程序，以文本文件形式输入输出-MPI parallel algorithm source code of Matrix multiplication,input and output in the form of txt files
martix_multi
- 实现矩阵乘法运算，用vc6.0开发，同时还实现方阵的幂运算。-The realization of matrix multiplication, using vc6.0 development, but also achieve the computing power of the square.
juzhenchengfa
- 该程序为在一个并行计算矩阵乘法的程序，需要在LINUX中安装MPI函数包。大家可以学习一下，感受一下并行计算的原理-The program for the calculation of matrix multiplication in a parallel process, you need to install the MPI function LINUX package. We can learn about and experience the principle of parallel
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
wll
- 该程序 描述了一个矩阵乘法动态万年历-................................
cannon1
- cannon的并行算法，使用MPI编写的，对矩阵乘法的一种运算方法-cannon of the parallel algorithm using MPI written as a matrix multiplication of the methods of calculation
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
Fibbonaci
- 计算费波拉系数 主要包括矩阵乘法 迭代法 递归法 公式法 -Pola coefficient calculating fees include recursive method iterative matrix multiplication formula for law, etc.
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
JUZHEN
- Descr iption 给定一个有N个矩阵的矩阵链A1A2A3...An，矩Ai的维数为pi-1*pi。我们都知道，使用朴素的矩阵乘法去乘两个维数分别为x,y和y,z的矩阵，所需要的乘法次数为x*y*z。矩阵链乘法问题就是如何对矩阵乘积加括号，使得它们的乘法次数达到最少。 Input 输入的第一行为一个正整数N(1<=N<=200)。表示矩阵的个数。 输入的第二行包含N+1个整数，分别表示pi(0<=i<=N)，其中每个pi在[1