搜索资源列表
stein
- 采用stein算法求两个任意大整数（超过计算机整形表示范围）的最大公约数。-STEINNESS algorithm used for two arbitrary integer large (over the scope of said plastic computer), the common denominator.
mgoldensection
- 对函数最优化，寻找最优点（使函数最小化），需要给出寻找范围-to function optimization, search for the most advantage (making function minimization), the need is to find the scope of
24Points-JavaVer
- 加减乘除24,java的GUI界面,输入的数字在1-13的范围内,产生的结果中已去除了冗余的结果,并统计产生结果的个数.- The arithmetic operations 24, java GUI contact surface, the input numeral in 1-13 scope, in the result which produces has removen the redundancy result, and the statistics has the result
RanMethod
- 随机搜索法,用于大型复杂优化问题.该方法只支持变量的范围约束,不支持其它类型的约束.-random search method for large complex optimization problems. The only support the scope of variables bound not to support other types of constraints.
CHASS
- 一个有关进制的和程序，它将一定范围内的数编制成组，通过从二进位制到十进位制， 进行编组，输入进制数和组数，即可自动计算出数据，并显示在屏幕上，同时输出到文件中，是很不错的程序，我用了好几天才编好，很精悍！-one of the 229 and procedures, it would certainly within the scope of the report into several groups, By binary system to the decimal system, org
complex_calculate
- 本程序新建complex类，并将数学库里的“+”“-”“*”“/”符号运算进行重载，使其适用范围从实数扩展至复数。-the new complex procedures category, Mathematics, 13-17 and the """-""*""/" symbol for heavy computation, from the scope of the application is extended
Matrix_Mutiply
- 用于解实数范围内的超定方程组。附带有详尽的程序说明文档。具体操作步骤可以参照说明。-for real solutions within the scope of the super-equations. With a detailed descr iption of the procedures for documentation. The specific steps could references.
Soft20060207115054365
- 查找素数 给定一个范围，自动查找并显示该范围内的所有素数。-finding prime numbers to set a range, automatic search and display within the scope of all prime numbers.
cbig
- 大数的阶乘 算法 初学者容易犯数据类型的范围溢出问题 初学者值得仔细研究-majority of the factorial algorithm beginners easily commit scope of the types of data overflow problems beginners deserves careful study
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
数学优化分析综合工具软件包
- 1stOpt 是七维高科有限公司（7D-Soft High Technology Inc.）独立开发， 拥有完全自主知识产权的一套数学优化分析综合工具软件包。在非线性回归，曲线拟合，非线性复杂模型参数估算求解，线性/非线性规划等领域首屈一指； 1stOpt 应用范围 1) 模型自动优化率定 2) 参数估算 3) 任意模型公式线性，非线性拟合，回归 4) 非线性连立方程组求解 5) 任意维函数，隐函数极值求解 6) 隐函数根求解，作图，求极值 7) 线
ndimensionNetwon
- 解非线性方程组的N元牛顿法，属于迭代法范畴-Solution of nonlinear equations of the N-Newton method, iterative method belonging to the scope of
fftw-2.1.5
- 该程序为fftw的简化高效版，fftw为MIT的开源fft程序，功能非常强大。包括范围也很广。这个为简单版本。-The program for high-performance version of fftw simplified, fftw for MIT s open source fft procedure, very powerful. Including a very wide scope. This for the simple version.
root_618
- 用黄金数0.618作为3折求根逐步缩小数据范围的完整程序-Using gold as the number of 0.618 Root 3 discount gradually narrowed the scope of the data integrity procedures
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
PI
- 计算圆周率的最简算法，内嵌汇编提速并扩大了计算范围，位数没有限制-Calculate pi to the most simple algorithms, embedded assembly calculation speed and expanded the scope of
Broyden_newton
- 最优化方法实验设计，研究Broyden族拟Newton算法中fai(k)取值的优化问题,即对于不同的目标函数，考虑取何值时算法是最优的，重点考察的区间[-2 2]范围内的变化情况，算法的优劣程度由CPU运行时间决定。-Optimization method, design of experiments to study the proposed Newton algorithm Broyden family fai (k) values of the optimization problem,
DivideAndConquer_Algo
- 1. 依照介面提示輸入yes 或 no 2. 每局結束後會印出你心中猜想的兩個數字並計算當次花費的回合數 3. 每局之間可連續 本程式採用的演算法策略為divide-and-conquer algorithm 1. 先將範圍盡量縮小，優先程序為先從小範圍求出一解 2. 盡量以2的次方數取範圍做分割尋找一個數字時，平均最佳的方法必是二分法。 因此如何以最小步數找到第一個解？若搜尋範我採用的方法，就是以最小步數先尋找到一個解，接著再用二分法找出剩餘的一個解。為了讓
taylor
- 用泰勒定理求根，根的范围在区间[0,1]之间 数值计算方法-Taylor' s Theorem with the Roots, the scope of the root in the interval [0,1] between the numerical method
qj
- 由给定区间范围及个数，求若干划分点，要求改点是整数，且最终能保证划分的每个区间长度相等。-Given the scope and the number of intervals, find the number of division points, requirements change point is an integer, and ultimately ensure the equal division of the length of each interval.