搜索资源列表
solver
- solves any equation of matrix Ax=b
qili
- 实现矩阵三角分解的乔利斯基方法及用此方法解Ax=b的方程。-Triangular matrix decomposition to achieve乔利斯基and use this method to solve the equation Ax = b.
1989xishujuzheng
- 稀疏矩阵采用三元组表示。（1）求两个具有相同行列数的稀疏矩阵A和B的相加矩阵C，并输出C。（2）求出C的转置矩阵D，输出D。-The use of sparse matrix triple that. (1) for the ranks of the two with the same number of sparse matrix A and B the sum of matrix C, and output C. (2) calculated C matrix transpose of D,
kalman_filter
- OPTIONAL INPUTS (string/value pairs [default in brackets]) model - model(t)=m means use params from model m at time t [ones(1,T) ] In this case, all the above matrices take an additional final dimension, i.e., A(:,:,m), C(:,:,m), Q(:,:,m), R
LSQR
- 采用CG法求解稀疏不对称的Ax=b-Implementation of a conjugate-gradient type method for solving sparse linear equations and sparse least-squares problems: Solve Ax = b or minimize || Ax- b ||2 or minimize || Ax- b ||2+ d2 ||x||2. The matrix A may be squ
MINRES
- 采用CG法求解稀疏对称奇异矩阵得到的Ax=b-Implementation of a conjugate-gradient type method for solving sparse linear equations: Solve Ax = b or (A- sI)x = b. The matrix A- sI must be symmetric but it may be definite or indefinite or singular. The scalar s is a
SYMMLQ
- 采用CG法求解稀疏对称非奇异矩阵得到的线性系统Ax=b-Implementation of a conjugate-gradient type method for solving sparse linear equations: Solve Ax = b or (A- sI)x = b. The matrix A- sI must be symmetric and nonsingular, but it may be definite or indefinite. The scal
BRMUL
- 求m*n阶矩阵A与n*k阶矩阵B的乘积矩阵C=AB-we can get the product matrix C from m*n matrix A and n*k matrix B.
BCMUL
- 求m*n阶复矩阵A与n*k阶复矩阵B的乘积矩阵C=AB。-we can get product matrix C from m*n complex matrix A and n*k complex matrix B.
work
- matlab 关于association rule 的自己写的函数，有3个文件, association.m：h = association(m, i, j) i=>j, m是数据，h是support和confidence，该函数只适用于单个数据 ass_item: h=ass_itset(m, a, b) 同上，但是可用于多个数据（m为数组） assrule: h = assrule(m, threshold1, threshold2) 该函数用于c
directed_network
- 以邻接矩阵的方式确定有向网，完成： A．建立并显示出它的邻接链表； B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）； C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况； D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adj
dctcode
- B = irdct2(A) returns the two-dimensional inverse discrete cosine transform of A. The matrix B is the same size as A and contains the discrete cosine transform coefficients B(k1,k2).
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
MatrixSerialMultiply1
- c++程序分别从文件1和文件2中读取矩阵A和B，进行相乘之后将矩阵C写到文件3中.-c++ program reads matrix a and b from file1 and file2 distributedly,then run matrix multiply and get matrix c,write the matrix c into file3.
pls_copy
- 这是一个非线性回归偏最小二乘程序，输入因变量与自变量，输出为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
fconv
- FFTD(T) performs a "Dimensionless DFT" on the columns of T. T may be real or complex. T may be any size. Returns the dimensionless (unitless) vector D and the universal Basis matrix B such that- FFTD(T) performs a "Dimensionless DFT" on the
acnv
- FFTD(T) performs a "Dimensionless DFT" on the columns of T. T may be real or complex. T may be any size. Returns the dimensionless (unitless) vector D and the universal Basis matrix B such that- FFTD(T) performs a "Dimensionless DFT" on the