搜索资源列表
matrix_multiply
- 自己编写的任意矩阵相乘的DSP程序，运行在CCS环境，平台为TMS320C6416。主程序用C语言编写，子程序用汇编编写完成矩阵相乘功能。-prepare their arbitrary matrix multiplication, the DSP, the running of the CCS environment, TMS320C6416 platform. Main program with C language, the subroutine with a compilation co
gengzheng
- 矩阵相乘的算法，请大家给点面子，也让我下载点东西，我本人能力不行，没有别的体面的奉献给大家了，希望大家体谅!-matrix multiplication, the algorithm to please everyone's face, let me also point to download things, not my ability, there is no other decent dedication to you, I hope you understand!
mul
- 在应用中常用矩阵相乘的定义算法对其进行计算。这个算法用到了大量的循环和相乘运算，这使得算法效率不高。而矩阵相乘的计算效率很大程度上的影响了整个程序的运行速度，所以对矩阵相乘算法进行一些改进是必要的。-commonly used in the application of the definition matrix multiplication algorithm for calculation. The algorithm uses a number of cycle and multiplic
juzenlianchen
- 1.能实现不同的个数的矩阵连乘. 2.最后矩阵大小是8X8. 3是最优的矩阵相乘. 描 述：给定n 个矩阵｛A1, A2,...,An｝，其中Ai与Ai+1是可乘的，i=1，2…，n-1。考察这n个矩阵的连乘积A1A2...An。矩阵A 和B 可乘的条件是矩阵A的列数等于矩阵B 的行数。若A 是一个p x q矩阵，B是一个q * r矩阵，则其乘积C=AB是一个p * r矩阵,需要pqr次数乘。-1. To achieve a number of different mat
Strassen_8
- Strassn关于两个矩阵相乘的算法，同过分治原理把两个n*n的矩阵阶各分解成四个n/2*n/2阶的矩阵，当分解出来的矩阵阶数等于2时，求借各个小矩阵，若阶数大与2，就递归的调用前面方法，直到分解成2*2的子矩阵为止。-Strassn on two matrix multiplication, the algorithm, with the governing principle over two n * n matrix of the band decomposed into 4 n / 2
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, ...
rmijuzheng
- 基于RMI分布计算实例(实现两个矩阵相乘)-RMI based distributed computing Example (2 matrix multiplication achieve)
SuanFaShiYan
- 这是本科算法实验中的程序包括快速排序，GREED算法硬币找零算法，会场排序和矩阵相乘算法。-This is the algorithm experimental procedures including rapid sequencing, GREED algorithm coins have sought algorithm, venue Scheduling algorithm and matrix multiplication.
11.c
- 矩阵相乘.zip - C语言源代码 矩阵相乘... - 本人这学期写八数码作业,采用三种人工智能算法,在-matrix multiplication. Zip-C language source code matrix multiplication ... - I wrote this semester eight digital operations, in three artificial intelligence algorithm, the
bpycsf
- 关于简单遗传算法和简单bp网络的程序,其中的矩阵相乘速度很快，而且比较容易扩展，即任意多的输入，任意多的隐含层-on simple genetic algorithms and simple bp network procedures, which the matrix multiply very fast, but relatively easy to expand, or arbitrary number of input and any number of hidden layer
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
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. Strassen algorithm and the tr
c++_class_matrix
- 完整的矩阵类，实现的功能如下： 方阵、拷贝构造、初始化,分配矩阵数据的内存,并全部置0、将方阵初始化为方阵、设置矩阵个元素的值、得到知道元素的值、获取矩阵的列数、获取矩阵的行数、获取矩阵的数据、获取指定行的向量、获取指定列的向量、重载运算符 = 、重载运算符 ==、重载运算符 !=、重载运算符 +、重载运算符 - 重载运算符 数乘*、重载运算符 矩阵相乘* 矩阵转置。-integrity of the matrix type, function as follows : Lineup
MatrixCal
- 提供矢量点乘，矩阵相乘，以及矩阵求逆等算法源代码，同时以动态链接库的形式打包，让初学者一个动态库制作的例子。-point by providing vector and matrix multiplication, and matrix inversion algorithm source code, the same time as a dynamic link library in the form of packing for beginners for producing a dynam
mpiaaaa
- 一个MPI的小程序，实现2个大矩阵相乘的秉性算法。用C写的，已调试通过。-a small procedures, two matrix multiplication, the algorithm propensity. C write, debug through.
matrix_mul
- 本程序对输入的矩阵选择最优相乘次序，并以此次序显示矩阵相乘的过程，输出所需相乘的次数-procedures for the importation of matrix multiplication order to choose optimal, and this order shows that the process of matrix multiplication. Output multiplication of the number required
mm_mpi_time1.f90
- fortran 用MPI并行的实现矩阵相乘-fortran MPI parallel with the realization of matrix multiplication
mm_mpi_2.f90
- 用MPI在fortran下 三维矩阵相乘的并行实现-with MPI in fortran three-dimensional matrix multiplication, the parallel implementation
mpichbingxingdiama0711
- 基于cannon算法的MPI环境的并行程序原代码 能够计算超大型矩阵相乘，本人的毕业设计 绝对经典-cannon algorithm based on the environment of MPI parallel programming code to calculate the original super matrix multiplication. I graduated from the absolute classic design
SimpleDataStruct
- 小弟初学者，简单数据结构： 包括单链表逆置，对陈矩阵相乘，分解单链表，分块查找，交换左右自述，模式匹配，二叉排序树、删除子串，冒泡排序等-younger beginners, a simple data structure : single-chain including inverse home, Chen matrix multiplication, single-chain decomposition. Search Block, exchange around the readme,