搜索资源列表
Interpolating
- Finds the polynomial p10 of degree less than or equal to 10 that interpolates cos x on the interval [0, PI/2] at 11 equally spaced points. Study the error betwee between the function and the polynomial at 41 equally spaced points over the same
Expert_Choice[1]
- Expert Choice represents a significant contribution to the decision making process 工t assists a decision maker in solving complex problems involving many criteria and several courses of action . An Expert Choice solution to a problem reflects the exp
yn
- 电路节点导纳矩阵的计算机生成法源程序。可计算少于20个节点的电路方程。-circuit node admittance matrix of computer generation source. Computable less than 20 nodes of the circuit equation.
3D-FDTD-Liao
- ３D-FDTD防真，边界为廖氏差分格式,程序使用计算机内存较少，可以用来做稍大尺寸物体的电磁防真-3D-FDTD defense truthfulness, Liao borders difference format, procedures use less computer memory. can be used to do slightly larger size object electromagnetic defense really
for_equation_real_radix
- 分别用二分法 Newton法 弦截法(割线法) 求方程x3-3x2+x-1= 0的全部实根(精度小于0.00001)。-respectively dichotomy Newton law xianjie (secant) Equation x3-3x2 x-1 = 0 all real roots (precision of less than 0.00001).
2FFT
- DIT-FFT算法子程序 FFT长度为2m，m为正整数。FFT输出结果放在输入复数数组中。其中xr存放信号序列实部，xi存放信号序列虚部。如果信号长度小于N，需要给xr和xi后面补足0，计算结果x(k)的实部和虚部仍然分别存放在数组xr和xi中。-DIT - FFT subroutine FFT length of 2m, m is a positive integer. FFT output on the importation of complex array. Xr which ke
DIT-FFTsuanfazichengxu
- DIT-FFT算法子程序 FFT长度为2m，m为正整数。FFT输出结果放在输入复数数组中。其中xr存放信号序列实部，xi存放信号序列虚部。如果信号长度小于N，需要给xr和xi后面补足0，计算结果x(k)的实部和虚部仍然分别存放在数组xr和xi中。-DIT - FFT subroutine FFT length of 2m, m is a positive integer. FFT output on the importation of complex array. Xr which ke
hex2ten
- huge hex convert to dec. the value limite is less that 10^50-huge hex convert to dec. The value is limite less that 10 ^ 50
bcd2asc_demo
- 一个码制转换的程序 BCD码转ASC码,功能虽少,但还算好用-a code system conversion process BCD switch ASC codes, although less functional, but rather user-friendly
primenumber.
- 一个求素数个数的程序 算pi(1000000000)不要1秒每个块如果10 0000, 需要 < 100000次全搜索加上8000 * 8000 < 6400 0000 总的次数小于7000 0000,就是说,搜索次数大大降低-for a few number-counting procedures pi (1000000000) not a second of each block of 10 0000, the need lt; Search 100,000 plenary wi
hurstZS.rar
- 另一种赫斯特指数的算法，此算法计算速度要快，但精度不及另一个。,Another Hurst exponent of the algorithm, this algorithm is faster, but the precision of less than another.
prime
- 用概率算法实现求素数10000以内的素数的问题，并且与确定性算法比较。-With the probability algorithm for prime numbers less than 10000 prime numbers, and compared with the deterministic algorithm.
pinv
- //奇异值分解法求广义逆 //本函数返回值小于0表示在奇异值分解过程, //中迭代值超过了60次还未满足精度要求. //返回值大于0表示正常返回。 //a-长度为m*n的数组，返回时其对角线依次给出奇异值，其余元素为0 //m-矩阵的行数 //n-矩阵的列数 //aa-长度为n*m的数组，返回式存放A的广义逆 //eps-精度要求 //u-长度为m*m的数组，返回时存放奇异值分解的左奇异量U //v-长度为n*n的数组，返回时存放奇异值分解的左奇异量
gaoweifangcheng
- 用matlab解高维微分方程组一般少用到,但是最近看了这方面的例子,希望对用到的人有所帮助-Matlab solutions with high-dimensional differential equations in general less used, but recently read examples in this regard, I hope to help people who use
Stateestimationindistributiongrids
- observable distribution grid are investigated. A distribution grid is observable if the state of the grid can be fully determined. For the simulations, the modified 34-bus IEEE test feeder is used. The measurements needed for the state estimati
PerfectRandom
- 完美随机数，即1 的概率，在执行一百次也肯定会出现1次；该代码随机产生5组20以内的排列-Perfect random number, that is 1 of probability, in the implementation of one hundred times there will be one meeting the code randomly generated 5 groups with 20 or less
083
- 歌德巴赫猜想：验证2000以内的正偶数都能够分解成两个素数之和，即验证歌德巴赫猜想再2000范围内的正确性-Goldbach conjecture: Verify 2000 is even less able to break down into two prime numbers and that the Goldbach conjecture and then verify that the scope of the correctness of 2000
SOR
- 逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯—塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯—塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Su
numberpaixu
- 关于分支为3的树，它的节点种类总数小于7，深度为3，全探索的源代码-With regard to the three branches of the tree, which is less than the total number of nodes of type 7, a depth of 3, all to explore the source code
Calculate-prime-number-less-than-100
- 计算100以内的质数 计算100以内的质数 -Calculate prime number less than 100