搜索资源列表
矩阵链乘算法
- 距阵链乘问题: 找出矩阵链乘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 algorithm Seeker
矩阵连乘的实用性问题
- 矩阵连乘的应用,可以帮助开发者学习矩阵连乘的问题,为开发者提供参考-matrix continually multiply the applications can help developers learn matrix continually multiply the problems of the development of reference for the
动态规划矩阵连乘
- 矩阵连乘。 输出所需最小连乘次数和计算序列。 使用的是动态规划算法。-matrix continually multiply. The required minimum output frequency and continually multiply calculated sequence. Using the dynamic programming algorithm.
C++matrix
- C++语言的复数与矩阵运算库,编写工程类软件必备。包括矩阵乘、加、数乘、逆等-C language in the plural and matrix operations for the preparation of engineering software required. Including matrix multiplication, Canada, multiply, the inverse
矩阵的运算算法
- 这里有加减乘和转置 用C语言编的 注意输入 算法用于稀疏矩阵 首先输入行,列,元素数目 再输入标志位 即每一列的第一个元素是矩阵中的第几个元素 再输入矩阵的元素 再选择符号-here and to take home series with C language to the attention of the importation of sparse matrix algorithm for the importation of the first rows and columns, the
矩阵连乘问题
- 用C++实现矩阵连乘问题-C matrix to achieve continually multiply problems
matrix
- 运用mpi库编写的矩阵乘benchmark
矩阵连乘
- 用动态规划解矩阵连乘问题-use dynamic programming solution matrix continually multiply problems
矩阵的连乘
- 一个解决矩阵连乘的程序-a program to solve the problems of continue multipling matrixes.
矩阵加减乘(M)
- 一个比较简单的算法程序。输入一些数,计算后按照矩阵的形式输出。设了三个数组a[],b[],c[]。分别实现c[]=a[]+b[],c[]=a[]-b[],c[]=a[]*b[]。-a relatively simple procedure of the algorithm. The importation of some few, calculated in accordance with the matrix in the form of output. Established three a
动态规划-矩阵连乘
- 由于矩阵连乘不同结合方式的运算工作量很不一样. 工作量相差也非常大;所以要寻找一种最佳的结合方式, 然后再执行矩阵乘法运算-continually multiply matrices combining different ways of computing workload very different. The workload is also very big difference; So to find the best combination of a way, and then th
动态规划----矩阵连乘问题
- 动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法,而是按不同输入给出问题的具体实例的子问题划分方法,然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下: 1)设置大小为连乘个数的方阵 2)主对角线上方各元素Di,j(i<j)表示矩阵Mi连乘到Mj的最小工作量 3)下方元素Di,j(i>j)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic prog
递推最小二乘估计算法
- 对于输入、输出数据较多的情况下,一次性完成的最小二乘估计算法计算量很大,速度降低而且有可能出现病态矩阵的情况,递推的最小二乘估计算法解决了上述问题。
二次曲线拟合---最小二乘法
- 最小二乘法拟合,其中应用了列主元高斯消去法处理矩阵
Matrix_Leastsquare.rar
- C#编写,包括两个类:矩阵运算,根据布尔莎模型通过最小二乘法计算七参数,C# Prepared, including two categories: matrix operations, according to Bursa model through the least squares method to calculate the seven parameters
matrixChain.rar
- 动态规划:矩阵连乘问题的模拟程序 参考清华王晓东的<算法设计与分析>,Dynamic programming: simulation program of matrix multiplying reference Qinghua Wang Xiaodong<Algorithm Design and Analysis>
Test2D
- 仿射变换与摄影变换,通过最小二乘算法计算变换矩阵。具体要有像点坐标文件,读取相应的文件即可在图上显示三位点的位置-Transformation affine transformation and photography, through the transformation matrix least-squares algorithm. Point coordinates should be as specific documents, read the corresponding docume
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
pipeidian_eight
- 计算机视觉中得八点算法,采用SVD分解最小二乘解来求基本矩阵,这是模拟仿真实验程序。-Was 8:00 in computer vision algorithms, using SVD decomposition least-squares solution to seek the fundamental matrix, which is simulation, experimental procedure.
Multiplicative-matrix
- 《算法分析与设计》中的矩阵连乘实现。算法参见《算法分析与设计》-Multiplicative matrix in《Algorithm Analysis and Design 》