搜索资源列表
歌德巴赫猜想
- 验证：2000以内的正偶数都能够分解为两个素数之和(即验证歌德巴赫猜想对2000以内的正偶数成立)。 *问题分析与算法设计 为了验证歌德巴赫猜想对2000以内的正偶数都是成立的，要将整数分解为两部分，然后判断出分解出的两个整数是否均为素数。若是，则满足题意；否则重新进行分解和判断。 程序中对判断是否为素数的算法进行了改进，对整数判断“用从2开始到该整数的一半”改为“2开始到该整数的平方根”。原因何在请自行分析。 -certification : 2000 within the
li_0101
- /*DCT和IDCT快速变换的C语言实现 仿效FFT的FDCT方法有与DCT无关的复数运算部分，选用代数分解法可以降低运 算量，达到高速运算的目的。代数分解法实现如下：对一维DCT表达式直接展开， 寻找各点表达式中共同项，仿FFT蝶形关系，将表达式中的共同项作为下一级节 点，依次进行多次，最后得到变换结果。*/-/ * DCT and IDCT rapid transformation of C language FFT follow the diagr
LU
- 1． Using LU factorization method to solve the following tri-diagonal system for n=10 and 100
ecmnet20ksrc
- 分布式大数分解程序源码，可以再多台机器上利用数域筛法分解大素数。-Distributed integer factorization program source code, the more the machine can use the number field sieve factoring large prime numbers.
P1
- 因式分解 将一个自然数分解为若干个素数的积 范围超大-Factorization would be a natural number is decomposed into a number of the product of prime numbers
qr
- OpenMP 实现QR 分解 环境 曙光 4000A集群-OpenMP to achieve QR decomposition Dawning 4000A cluster environment
pdpta02.ps
- Parallel Takachi factorization
huffman1
- RSA算法基于一个十分简单的数论事实：将两个大素数相乘十分容易，但那时想要对其乘积进行因式分解却极其困难，因此可以将乘积公开作为加密密钥。-RSA algorithm based on a very simple fact: the number multiplies two large prime number is very easy, but then to factorization of its product is extremely difficult, so it can be
multi_nmf_toolbox
- 这是经典文章“Multichannel Nonnegative Matrix Factorization in Convolutive Mixtures for Audio Source Separation”的matlab源代码-This is a classic article the " Multichannel Nonnegative Matrix Factorization in Convolutive Mixtures for Audio Source Separatio
MM-for-NMF
- 文献“Majorization-minimization algorithm for smooth Itakura-Saito nonnegative matrix factorization”的matlab仿真源码-Matlab simulation source literature Majorization-minimization algorithm for smooth Itakura-Saito nonnegative matrix factorization "
yinshifenjie
- 这个代码是解决因式分解的问题，虽然看上去很简单，但是是原创的哦-This code is the solution to the problem of factorization, although it seems very simple, but original
graphpartition
- MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report: Joã o Hespanha. An efficient MA
CWM-code
- 本程序适用于论文A Cyclic Weighted Median Method for L1 Low-Rank Matrix Factorization with Missing Entries-this code is for A Cyclic Weighted Median Method for L1 Low-Rank Matrix Factorization with Missing Entries
qr_fact
- qr factorization using hh algorithm colum pivioting
lu
- 数值代数的LU分解c++实现 数值代数的LU分解c++实现-LU factorization LU factorization LU factorization LU factorization LU factorization LU factorization LU factorization
primeFactorization
- 基数分解 求一个数的所有基数 比如 6 =3 * 2-prime Factorization that suppose there is a integer 6, the result is 6 =3* 2
nmf
- 非负矩阵分解，将一个非负矩阵分解成两个非负矩阵的乘积-non-negative matrix factorization