Location:
Search - iterations
Search list
Description:
Platform: |
Size: 5853 |
Author: |
Hits:
Description: 遍里数据库集合里的数据-times database, the data pool
Platform: |
Size: 6166 |
Author: 张兵 |
Hits:
Description: 用遗传算法解决函数优化问题原代码
求出最优解与迭代次数-genetic algorithm optimization function source obtained with the optimal solution iterations
Platform: |
Size: 1334 |
Author: 小翠 |
Hits:
Description: Introducing the new and improved CGraph Classes!!
CGraph was my attempt to produce a set of freeware graph classes. After several iterations of the classes, it became more and more difficult to maintain and support.
这是我在CGRAPH4的基础上和StringFile和CString类进行了整合形成的新的例子-Introducing the new and improved CGraph Cl asses! ! CGraph was my attempt to produce a set of freeware graph classes. After several iterati ons of the classes, it became more and more difficult to maintain an d support. this is my CGRAPH4 and on the basis of StringFile and CStr ing type of integration for the new examples
Platform: |
Size: 828601 |
Author: 罗成 |
Hits:
Description: For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix.
heuristics: descent.
Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations.
heuristics: Simulated annealing.
Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations.
heuristics: based on Simulated Annealing.
Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations.
-For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
Platform: |
Size: 52579 |
Author: ZHU |
Hits:
Description: 利用分形递归算法实现Cantor三分集，实现有限次迭代！-use fractal recursive algorithm Cantor third set and achieve limited iterations!
Platform: |
Size: 40931 |
Author: 王凯 |
Hits:
Description: 这是一款轻松实现des编码的源码，本程序用了一个列表框来显示所有16次迭代的所有信息-easily des source code, this program uses a list box to display all 16 iterations of all the information
Platform: |
Size: 151900 |
Author: 小刚 |
Hits:
Description: 用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关，迭代次数越多，精度越高。本例子中精确到小数点后4位。要提高迭代次数，还得把增加1QN格式的位数，比如32位long，程序多处需要修改，有需要的话自己改吧。
-CORDIC algorithm with the two parameters arc tangent. And the accuracy of the CORDIC iteration number, the more the number of iteration, the higher the accuracy. This case accurate to four decimal places. To raise the number of iterations, it has to the increase in a 2:30 format of the median, such as 32 long, multiple procedures need to change, the need to reform it themselves.
Platform: |
Size: 1921 |
Author: 陈朋 |
Hits:
Description: With the interference-to-noise ratio reduced to 30 dB, plot the adaptive antenna pattern after 200 iterations of the LMS algorithm-With the interference-to-noise ratio of red uced to 30 dB. plot the adaptive antenna pattern after 200 ite rations of the LMS algorithm
Platform: |
Size: 2853 |
Author: 游辉章 |
Hits:
Description: 空间后方交汇求解相机外方位元素，变量如下
％ x，y 控制点像点坐标
％ X，Y，Z 控制点空间坐标
％f焦距
％X0，Y0，Z0，a，b，c六个外方位元素
％x0，y0，-f内方位元素：光心坐标
％cha，chb，chc：外方位角元素改正数
％count 记录迭代次数
％R 旋转矩阵
％A 线性化的偏导系数矩阵
％L 常数项矩阵
％M0 外方位元素矩阵
％M1 外方位元素改正数矩阵-meeting space for rear camera position outside elements, as follows% variable x, y control point pixel coordinates% X, Y, Z coordinates control room focal length f%% X0, Y0, Z0, a, b, c 6 exterior orientation elements% x0, y0, - f position within elements : Optical Center coordinates% cha, chb, chc : Foreign elements azimuth correction% record count the number of iterations rotation matrix R%% A linear partial derivative of the coefficient matrix% L constant Matrix% M0 Orientation% M1 matrix elements of exterior orientation correction matrix
Platform: |
Size: 1707 |
Author: 王立钊 |
Hits:
Description: DES算法把64位的明文输入块变为64位的密文输出块，它所使用的密钥也是64位，首先，DES把输入的64位数据块按位重新组合，并把输出分为L0、 R0两部分，每部分各长32位，并进行前后置换（输入的第58位换到第一位，第50位换到第2位，依此类推，最后一位是原来的第7位），最终由L0输出左 32位，R0输出右32位，根据这个法则经过16次迭代运算后，得到L16、R16，将此作为输入，进行与初始置换相反的逆置换，即得到密文输出。-DES algorithm combines the 64 expressly to block the importation of 64 of the ciphertext output block, it is also the key 64, first of all, DES importation of 64 data blocks per caput regrouped and the output is divided into L0, R0 two parts, each of the 32 long, and pre - and post exchange (the importation of 58 account for one, 50 for the first of two, and so forth. the final one is the original clause 7), and ultimately by the L0 32 left output, the output right R0 32, Under this rule after 16 iterations operator, was L16, R16 and as input, with the initial replacement for the opposite inverse replacement, which is the output ciphertext.
Platform: |
Size: 69091 |
Author: fasf |
Hits:
Description: lanczos迭代残差变化计算，给定矩阵，初值和右端项，返回残差，迭代次数和矩阵解-lanczos iterative changes residuals, given matrix, and the initial subguadratic return to residuals, the number of iterations and the solution matrix
Platform: |
Size: 1004 |
Author: 卜凡民 |
Hits:
Description: 给出了二次函数的Julia集分形图的概念及逃逸时间算法绘制复杂分形图的基本原理,对Julia集给出了严格的数学定义.逃逸时间算法即取定迭代次数界限N,经N次迭代后,若x点仍在给定的区域内,则认为x是分形A中的点 否则x不是分形A中的点.该算法同样适用于Mandelbrot集、Sierpinski三角形等其他复杂分形图.试验表明,该算法绘制的Julia集分形图准确有效、优美清晰,算法简单实用.
-given quadratic function of the Julia set fractal images and the concept of escape time algorithm mapping complex fractal graph - The principle of Julia Sets is a strict mathematical definition. Escape from time algorithm that will limit the number of iterations N, by the N-th iteration, if x is still point to the region, think x A fractal is the point otherwise x A fractal is not the point. It is also applicable to Mandelbro t set, Sierpinski triangle and other complex fractal images. Test shows that The algorithm mapping the Julia set fractal images accurately and effectively, a beautiful clear, simple and practical algorithm.
Platform: |
Size: 1136 |
Author: 为听 |
Hits:
Description: 一个可根据输入的迭代次数画出分形三角形的小程序-one can input the number of iterations painted fractal small triangular procedures
Platform: |
Size: 42837 |
Author: 白洁 |
Hits:
Description: 以下是我的共轭梯度法的C语言程序,迭代次数超多，矩阵的条件数并不大可以用共轭梯度法解。-Following is the conjugate gradient method in C language program, the number of iterations Chao, Matrix condition number is not large can conjugate gradient method solutions.
Platform: |
Size: 1605 |
Author: xiaozhi |
Hits:
Description: Jacobi迭代的算法
根据给出的系数矩阵和函数值以及需要精度
能求出方程值，以及迭代次数-Jacobi iteration of the algorithm is based on the coefficient matrix and function values and the need for accuracy can be obtained value equation , and the number of iterations
Platform: |
Size: 234638 |
Author: cmooc |
Hits:
Description: 1.功能
利用连分式法求非线性方程f(x)=0的一个实根(C语言)
2.参数说明
double *x : 指向迭代初值，返回时指向迭代终值
double eps : 控制精度要求
double (*f)() : 指向计算f(x)值的函数名(由用户自编)
int pqrt() : 函数返回迭代次数
3.文件说明
pqrt.c为函数程序
pqrt0.c为主函数程序-1. Continued Fractions functional method using nonlinear equation f (x) = 0 is a root (C) 2. Parameters Note double * x : at the initial iteration, iterative return at the terminal value double eps : control precision double (* f) () : point calculations f (x) value of the function name (designed by the user) int pqrt () : function returns the number of iterations 3. This document explains procedures pqrt.c to function mainly function procedures pqrt0.c
Platform: |
Size: 1666 |
Author: 罗坤 |
Hits:
Description: 两靖rayleigh衰落信道仿真。This m-file uses successive iterations of data to create an animated =
effect
％showing the results of passing an unmodulated carrier through a simple =
two
％path Rayleigh fading channel. The following formula and diagram
％illustrates the m-file operation. The animation shows, input(blue)
％and the output(red), the the phase shifts, gains, and attenuations
％of the output sine wave or carrier.
Platform: |
Size: 1597 |
Author: 刘美 |
Hits:
Description: he power method will be applied to the jacobian matrix of the
2-D henon map to approximate the first Lyapunov exponent by creating
a graph of ln|yn| vs. n, where n is the number of iterations of the
power method and yn = 1/n*ln|DG^n(xo)*yo|. The slope will be an
approximation to the largest Lyapunov exponent.-he power method will be applied to the jacob ian matrix of the 2-D map to approximate henon th e first Lyapunov exponent by creating a graph of ln | yn | vs. n, where n is the number of iterations of the power m ethod and yn = a / n * ln | DG ^ n (xo) * yo |. The slope w ill be an approximation to the largest Lyapunov exponent.
Platform: |
Size: 1428 |
Author: 杨蒙 |
Hits:
Description: 制作分形图形的软件,很好用-producing fractal graphics software, is useful
Platform: |
Size: 661504 |
Author: 科学 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
31
»