搜索资源列表
lsq
- The module LSQ is for unconstrained linear least-squares fitting. It is based upon Applied Statistics algorithm AS 274 (see comments at the start of the module). A planar-rotation algorithm is used to update the QR- factorization. This makes it
connvert
- 对矩阵进行LU分解并求逆，该程序适用于任意维数方阵，-right matrix factorization and inverse, the procedures applicable to arbitrary dimension arrays
cholesky323232
- 平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies:
LU_decompostion
- 矩阵的LU分解的改进型算法。优点是快捷-matrix factorization of the improved algorithm. Advantage is speed.
t2_3
- 本题采用的计算方法为：矩阵的 分解和Cholesky分解。根据Gauss消去法的的矩阵意义，可以将矩阵A分解为一个单位下三角矩阵与一个上三角矩阵的乘积即：即矩阵的LU分解A=LU，进而可以分解为： 的形式。当A为对称矩阵时，A可分解为： 的形式。-that the use of the method of calculating : matrix decomposition and Cholesky decomposition. According to the Gauss eliminatio
cad01
- 用LU分解实现解方程，用visual C++编写，可以使用一下-with factorization of solving equations, using visual C, can use this to s
power2
- 2． Using QR factorization to find all of the eigenvalues and eigenvectors for the following matrix
NumericalLinearAlgebra
- 数值线性代数的Matlab应用程序包 共13个程序函数，每个程序函数有相应的例子函数一一对应，以*Example.m命名 程序名称 用途 Method 方法 GrmSch.m QR因子分解 classical Gram－Schmidt orthogonalization 格拉母－斯密特 MGrmSch.m QR因子分解 modified Gram－Schmidt iteration 修正格拉母－斯密特 householder.m QR因子分
CoinUtils-2.2.5
- The CoinUtils project is a collection of open-source utilities developed and used by a variety of other projects in the COIN-OR repository. The project includes classes for storing and manipulating sparse matrices and vectors, performing matrix facto
GNMF
- 菜登和何晓飞, 2010的PAMI 基于图的非负矩阵分解的paper极其matlab代码。这篇文章在非负矩阵分解中巧妙地加入了流形约束，并推导出了相应的迭代公式。-He Xiaofei Teng and vegetables, 2010 PAMI graph-based non-negative matrix factorization of the paper is extremely matlab code. This article in the non-negative matrix
ldiv
- The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively. The fu
3107002005_2nd_A_LDL
- LDL分解。作为矩阵方程数值解法最基础的矩阵分解算法，LDL算法可以高效分解对称矩阵。-LDL decomposition. Numerical Solution of matrix equation as the most basic matrix factorization algorithm, LDL decomposition algorithm can be efficient symmetric matrix.
numerical-method
- 数值方法课程中的程序，如GaussSeidel迭代法解方程组，Jacobi迭代法解方程组，SOR迭代法解方程组，杜利特尔矩阵分解以及矩阵的直接解法，拉格朗日插值等11个程序。-Courses in numerical methods, such as iterative method for solution GaussSeidel equations, Jacobi iterative method for solution of equations, SOR iterative method
superlu_3.1.tar
- SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perf
taucs_full
- TAUCS是解稀疏线性问题的C语言库。包括： 多波Supernodal Cholesky分解； 左看Supernodal Cholesky分解 -TAUCS is a C library of sparse linear solvers. The current version of the library includes the following functionality: Multifrontal Supernodal Cholesky Factoriza
QR
- 对一般矩阵的矩阵QR分解，其中R是对角线元素全为非负实数的上三角矩阵，Q为正交矩阵-QR factorization
nmf_test
- 关于非负矩阵分解的算法c++实现，面向对象实现-Non—negative matrix factorization algriothm with c++ and oop
LU
- 利用高斯消元列选主元法进行矩阵的LU分解和利用此分解解线性方程组-LU matrix factorization and use this decomposition of Linear Equations
smartinv
- 通过求解LU分解解线性方程组 大型稀疏矩阵LU分解有用的是容易计算的。不是最快的方式来计算逆矩阵，但要避免消耗储存的问题-computing selected entries of the inverse, by solving a sequence of linear equations after doing an LU factorization. Useful for large sparse matrix which LU decomposition is easy to c
factorization
- factorization prime digit