搜索资源列表
marombmasimp
- 格式：x=masor(A,b,omega,x0,ep,N) A为系数矩阵，b为右端向量， 用途：用复辛普生形公式求积分。- Format: x = masor (A, b, omega, x0, ep, N) A as the coefficient matrix, b for the right-hand side vector, Uses: The complex shape Simpson quadrature formula.
matlab
- jpeg to data matrix in r,g,b
gauss-jakobi
- SOLVING A LINEAR MATRIX SYSTEM AX=B with Gauss Jordan Method
juzhen
- 用C++实现稀疏矩阵A和稀疏矩阵B的相加-Using C++, sparse matrix A and the sparse matrix B, add
5-2
- 用三元组存放输入的两个稀疏矩阵A34和B34，将稀疏矩阵A转置后与稀疏矩阵B相乘，结果存放三元组C，并输出结果-The triples store of the two input sparse matrix A34 and B34, the sparse matrix A transpose sparse matrix B after multiplying the result stored triple C, and output
5-3
- 输入并建立两个稀疏矩阵A和B的十字链表, 输出稀疏矩阵, 两完成两稀疏矩阵的加法运算,结果存放在稀疏矩阵A中, 要求相加结果为0的元素从结果稀疏矩阵的十字链表中删除, 输出A稀疏矩阵-Input and the establishment of two sparse matrices A and B, cross linked, the output matrix, the two completed the addition of two sparse matrix computation,
yakebi
- 对线性方程组进行求解，可以从键盘上输入A和B两个矩阵，然后即返回结的结果-For solving linear equations, the keyboard input from A and B two matrix, then return and results
Gauss
- 用全选主元Gauss消去法求解线性方程组。其中a是方程组的系数矩阵，b是右端常数向量，并存放最终解向量，n是阶数。-With full pivoting Gauss elimination method for solving linear equations. Where a is the coefficient matrix, b is the right end of the constant vector, and store the final solution vector, n i
Gauss_Jordan
- 全选主元Gauss-Jordan消去法求解线性代数方程组。其中a是方程组系数矩阵，b先存右端的m组常数向量，之后存解向量。n是阶数，m是右端常数向量组数。-Select the main element Gauss-Jordan Elimination method for solving linear algebraic equations. Where a is the coefficient matrix, b right side of m pre-existing group of c
Levinson
- 采用列文逊递推算法求解对称托伯利兹型方程组。其中t存放T型矩阵的元素。b是右端常数向量。x是解向量。n是阶数。-Using Levinson recursion algorithm for symmetric Tuobolizi equations. Where t T-matrix elements of deposit. b is the right end of the constant vector. x is the solution vector. n is the order.
Strassen
- 设A 和 B 是两个n * n阶矩阵，求它们两的乘积矩阵C。这里，假设n是2的幂次方；-N*N matrix
Floyd-Matlab
- floyd算法的matlab程序 floyd-最短路问题 输入： B-邻接矩阵(bij)，指i到j之间的距离，可以是有向的。 sp- 起点标号。 ep- 终点标号。 输出： d- 最短路的距离。 path-最短路的路径。-floyd algorithm matlab program floyd-shortest path problem Input: B-adjacency matrix (bij), refers to the distan
Embiggen
- Add (or multiply, divide, etc) a matrix A to a vector b with the simple syntax A + Embiggen(b)
fecgm
- 独立成份分析（ＩＣＡ）以及ｗｉｎｎｅｒ滤波 Source separation of complex signals with JADE. Jade performs `Source Separation in the following sense: X is an n x T data matrix assumed modelled as X = A S + N where o A is an unknown n x m matrix with full rank.
fisher
- 费希尔线性判别分析代码 Find the Fisher linear separator w (a column vector). X is is the training set (X is a matrix. Each row of X is a vector containing the features of a single sample). y is a column vector with the labels of the training set (1
siyuanshu2
- 不同坐标系下相同测量点之间的四元数转换矩阵求解，可以此来求解坐标系A到坐标系B之间的转换矩阵-Different coordinates between the same measurement points quaternion transformation matrix solution can be used to solve this coordinate system A to coordinate system transformation matrix between B
GaussElimination
- 使用高斯消元法，解线性方程组。写作AX=B型的矩阵形式解决。-Using Gaussian elimination, solution of linear equations. Writing AX = B type of matrix solution.
Gauss_Elimination
- 使用高斯消元法，解线性方程组。写作AX=B型的矩阵形式解决。-Using Gaussian elimination, solution of linear equations. Writing AX = B type of matrix solution.
A_LU
- bool lu(double *a, int *pivot, int n)；矩阵的LU分解。 假设数组an*n在内存中按行优先次序存放，此函数使用高斯列选主元消去法，将其就地进行LU分解。pivot为输出函数.pivot[0,n)中存放主元的位置排列. 函数成功时返回false，否则返回true. bool guass(double const *lu, int const *p, double *b, int n) 求线性方程组的解。 假设矩阵lum*n为某个矩阵a
A_QR
- void qr(double *a, double *d, int n) 矩阵的QR分解 假设数组an*n在内存中按行优先次序存放，此函数使用HouseHolder变换将其就地进行QR分解。 d为输出参数，d[0,n)存放QR分解的上三角矩阵对角线元素。 bool householder(double const *qr, double const *d, double *b, int n) 求线性代数方程组的解。 假设矩阵qrn*n为某个矩阵an*n的QR分解，在内