搜索资源列表
矩阵链乘算法
- 距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引-matrix chain by : identify matrix chain by A (35 * 40) A (40 * 20) A (20 * 10) A (10 * 15) concludes the best order. Algorithm from : computer
向量矩阵乘
- 这个源代码的功能是实现矩阵向量乘的算法。
矩阵相乘的快速算法
- 矩阵相乘的快速算法-rapid matrix multiplication algorithm
矩阵的运算算法
- 这里有加减乘和转置 用C语言编的 注意输入 算法用于稀疏矩阵 首先输入行,列,元素数目 再输入标志位 即每一列的第一个元素是矩阵中的第几个元素 再输入矩阵的元素 再选择符号-here and to take home series with C language to the attention of the importation of sparse matrix algorithm for the importation of th
strassen矩阵相乘
- 算法分析实验报告：Strassen矩阵乘法，无问题-algorithm analysis experiment : Strassen matrix multiplication, no problem
动态规划法解决矩阵连乘积问题
- 这是一个小弟用动态规划法解决矩阵连乘积问题的一个算法。-This is a younger dynamic programming matrix to solve even the product of an algorithm.
MatrixMul
- 矩阵连乘算法，实现几个矩阵相乘的最优顺序，并计算出复杂度-matrix continually multiply algorithm, achieving several matrix multiplication, the optimal sequence and calculated complexity
动态规划矩阵连乘
- 矩阵连乘。 输出所需最小连乘次数和计算序列。 使用的是动态规划算法。-matrix continually multiply. The required minimum output frequency and continually multiply calculated sequence. Using the dynamic programming algorithm.
nlinfit
- 非线性最小二乘算法，矩阵和向量类为自己编写，用数组代替也可以-nonlinear least-squares algorithm, matrix and vector category for their preparation, with the array can be replaced
hl_strsn
- C++编写的高性能矩阵乘法的Stranssen算法，能够有效提高矩阵乘法的效率。-C preparation of high-performance Stranssen matrix multiplication algorithm, can effectively improve the efficiency of matrix multiplication.
2006062915403226928
- 矩阵连乘new， 矩阵链乘算法实现DLL与演示-Matrix even by new, matrix-chain by Algorithm DLL and Demonstration
chengxu
- 用vc++求解五阶矩阵的算法代码，可以用于图像处理的最小二乘法椭圆拟合曲线-With vc++ Solving fifth-order matrix algorithm code can be used for image processing of the least squares ellipse fitting curve
m12_3
- 为了改善噪声e(k)为有色噪声模型的系统参数估计的统计特性，提出了一种增广矩阵的方法，称为增广最小二乘算法，MATLAB实现范例-In order to improve the noise e (k) for the colored noise model of the system parameters estimated statistical characteristics, an Augmented Matrix method,
Test2D
- 仿射变换与摄影变换，通过最小二乘算法计算变换矩阵。具体要有像点坐标文件，读取相应的文件即可在图上显示三位点的位置-Transformation affine transformation and photography, through the transformation matrix least-squares algorithm. Point coordinates should be as specific documents,
KPLS
- 基于核函数的偏最小二乘算法，先对原矩阵进行核函数非线性变化，再用非线性迭代求解-Kernel-based partial least-squares algorithm, first the original non-linear function of changes in the nuclear matrix, and then non-linear iterative solution
juzhenliancheng
- 算法 矩阵连乘算法 很简单的实现 大家有兴趣的可以看看 -Algorithm matrix multiplication algorithm with very simple realization of everyone interested can see
Cannon
- 实现了矩阵乘法的cannon算法。用MPI编程，在并行环境中可运行-Cannon implements matrix multiplication algorithm. Programming with MPI, can run in parallel environment
第一次实验程序
- 矩阵乘法的不同循环方式的算法实现，比较了各种算法所用时间的长短(Matrix multiplication of different cycle mode algorithm, compared to the length of time used in various algorithms)
cannon
- 矩阵乘Cannon并行算法的MPI+Fortran实现(Parallel program of Cannon algorithm with MPI and Fortran)