搜索资源列表
歌德巴赫猜想
- 验证：2000以内的正偶数都能够分解为两个素数之和(即验证歌德巴赫猜想对2000以内的正偶数成立)。 *问题分析与算法设计 为了验证歌德巴赫猜想对2000以内的正偶数都是成立的，要将整数分解为两部分，然后判断出分解出的两个整数是否均为素数。若是，则满足题意；否则重新进行分解和判断。 程序中对判断是否为素数的算法进行了改进，对整数判断“用从2开始到该整数的一半”改为“2开始到该整数的平方根”。原因何在请自行分析。 -certification : 2000 within the
factorization
- factorization.zip
GEE
- 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
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
Factorization
- Lucas-Kanader-Tomasi Feature Tracker，由运动恢复结构的问题，目的是从一组由摄像机移动获得的图像来恢复一个场景的立体结构。对于这个问题，C.Tomasi和T.Kanade[1]于1992年提出了一种Factorization的方法，可以有效地避免噪声的干扰，同时不会受限于特定的运动模型，例如单纯的平移或是旋转。-Lucas-Kanader-Tomasi Feature Tracker, by the movement to restore the structu
FHSVD
- HankelToeplitz and Takagi Factorization Package
kolmog
- 给定任意一个子波，通过克基霍夫变换返回最小相位子波。-Kolmogoroff spectral factorization. Given an arbitrary wavelet this function retrieves the minimum phase wavelet using Kolmogoroff factorization
KLU-1.1.0.tar
- 对稀疏矩阵进行LU分解，可用于电路仿真、FEM求解等 C语言-KLU is a sparse LU factorization algorithm well-suited for use in circuit simulation. KLU is a sparse LU factorization algorithm well-suited for use in circuit simulation. It was highlighted in the May 2007 issue of SIA
Gram_S
- classical Gram-Schmidt(unstable) (reduced QR factorization).A:m-by-n matrix. (m>=n)Q:m-by-n unitary matrix.R:n-by-n upper triangular.-classical Gram-Schmidt(unstable) (reduced QR factorization).A:m-by-n matrix. (m>=n)Q:m-by-n unitary matrix.R:
factorization
- 对整数进行因数分解，输入整数，输出因数分解-Factorization of the integers
LU
- In linear algebra, LU decomposition (also called LU factorization) is a matrix decomposition which writes a matrix as the product of a lower triangular matrix and an upper triangular matrix. The product sometimes includes a permutation matrix as well
QR
- a QR decomposition (also called a QR factorization) of a matrix is a decomposition of the matrix into an orthogonal and an upper triangular matrix. QR decomposition is often used to solve the linear least squares problem, and is the basis for a parti
Nonnegative_matrix_factorization.tar
- Nonnegative_matrix_factorization是实现非负矩阵分解的程序，该算法可以用来进行图像分解和模式识别 -Nonnegative_matrix_factorization is to achieve non-negative matrix factorization procedure, the algorithm can be used for pattern recognition and image decomposition
factorization
- factorization prime digit
Factorization-method
- 用因式分解的方法求解方程。。 .-Factorization method for solving equations
Positive-integer-factorization
- 实现正整数分解功能，能够分解任意给定的非零整数-Positive integer factorization, can decompose any given non-zero integer
non negative matrix factorization
- non negative matrix factorization for audio source seperation
Total Variation Regularized Reweighted Sparse Nonnegative Matrix Factorization for Hyperspectral Unmixing
- Total Variation Regularized Reweighted Sparse Nonnegative Matrix Factorization for Hyperspectral Unmixing.By Wei He