资源列表
jacobi
- 对于方程组AX=b，当系数矩阵非奇异时，对原方程进行改写，利用公式X^k=BX^(k+1)+g进行迭代求解。-For equations AX = b, when the coefficient matrix is nonsingular, rewriting the original equation, using the formula X ^ k = BX ^ (k+1)+g for iterative solution.
gs
- 高斯-塞德尔迭代方法，于雅可比迭代不同之处是将每次迭代的最新结果，用在当前迭代过程中。-Gauss- Seidel iteration method, the Jacobi iteration is different from the latest results of each iteration, the process used in the current iteration.
Gmin
- 利用Fortran语言编制的填充函数法求解全局最优解-Compiled using the Fortran language filled function method for solving the global optimal solution
jisuanjihe
- 计算几何算法分析与设计，计算几何算法分析与设计.pdf-Computational Geometry Algorithm Analysis and Design
chengxusheji
- E3 80 8AMATLAB程序设计教程》电子教案-附源代码,挺有用的-Programming Guide
myEuclid
- compute the greatest common divisor of two integers
MyShuffleTest
- Suppose we start with N=3 and run the shuffling test four times, resulting in the arrays: [2, 0, 1] [2, 1, 0] [2, 0, 1 ] (This not very likely, but i s possible) Then the resulting count array would be: 0: 0 3 1 1: 0 1 3
MyFibonacci
- The idea is that as Fibonnaci values are computed you store them in the array A. So when another F(n) is to be computed either A[n] is still 0 or else A[n] is already equal to F(n). If A[n] is 0, you have to make the usual recursive calls to comput
MyBinarySearch
- For this problem, you will need to create an second array that is smaller than the original whitelist. You need to go through the original whitelist twice: once to determine the number of unique items in the whitelist and a second time to copy the un
C_Algorithm
- 用C语言实现的各种算法的程序集合，基本包含了实用的全部基础算法，内容相当全面。-Using C language implementation of the various set of algorithm, the basic foundation that contains all the practical algorithm, the content is very comprehensive.
122582345098
- 计算器 可换皮肤 功能稳定 很好 网络实用 很强大-Calculator function for skin very strong stable good network utilities
calculation
- 简单整数计算器，可以计算简单的加法减法乘法除法和乘方，输出为浮点。-simple calculate machine