搜索资源列表
ols
- 正交最小二乘辨识算法 该算法除了实现最小二乘辨识功能之外而且能按照各项重要性将其逐一选出并且估计相应系数-OLS Orthogonal Least Quares. [x, ind] = OLS(A,b,r) gives the solution to the least squares problem using only the best r regressors chosen from the ones present in matrix A. This
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
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分解，在内
maxsize
- 稀疏矩阵采用三元组表示。 （1）求两个具有相同行列数的稀疏矩阵A和B的相加矩阵C，并输出C。 （2）求出C的转置矩阵D，输出D。-Sparse matrix expressed by triples. (1) Find the ranks of the two have the same number of sparse matrix A and B of the sum matrix C, and the output C. (2) find the C of the transp
Cellular-Neural-Network
- 细胞神经网络(CNN)是一种和人类神经网络非常相似的并行计算模型，各个邻接节点间有不同的通信。在本程序中A模型是反馈矩阵，B是控制矩阵。-Cellular neural network (CNN) is very similar to the human neural network model of parallel computation, all adjacent nodes have different communication. A model of this process is
pls
- 输入自变量与因变量，输出x。y主成分、负荷及回归系数- Inputs: x x matrix y y matrix Outputs: t score for x p loading for x u score for y q loading for y b regression coefficient