资源列表
t2_3
- 本题采用的计算方法为：矩阵的 分解和Cholesky分解。根据Gauss消去法的的矩阵意义，可以将矩阵A分解为一个单位下三角矩阵与一个上三角矩阵的乘积即：即矩阵的LU分解A=LU，进而可以分解为： 的形式。当A为对称矩阵时，A可分解为： 的形式。-that the use of the method of calculating : matrix decomposition and Cholesky decomposition. According to the Gauss eliminatio
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
lagrange+newton
- 数值计算方法--拉格朗日插值法和牛顿插值法-Numerical method- Lagrange interpolation method and the Newton interpolation
Newtton
- implementation Newtton algorithm in C-implementation Newtton algorithm in C++
binarytree
- 二叉树遍历程序，包含前序中序和后序遍历，递归和非递归的方法-Binary tree traversal process, including pre-order in the sequence and post-order traversal, recursive and non recursive method
hw1
- 输入两个数, 计算最大公约数和最小公倍数-Enter two numbers to calculate the greatest common divisor and least common multiple !!!!!!!!!!!!!!!!!!!!!!!!!
Heat_Tranfsfer
- 计算二维平面内，自然对流换热过程，得到内部的温度分布-Of two-dimensional plane, the natural convection heat transfer process, to get the temperature distribution inside
subarray
- C语言实现了一个数组的所有子集，包括0集，使用了暴力法-All Subarray of an Array
nrq
- 非递归快排，用stack实现的，包含一个test.h头文件-Non-recursive fast row stack to achieve a test.h header file
create_binarytree
- 因为程序中要知道叶子结点（终点），所以要将上面的二叉树变成扩展二叉树 (把叶子结点的孩子补成#, 用作标记),以此方式创建二叉树-create binarytree
pso
- 计算给定函数的全局最优位置以及优化极值，并输出结果-Calculating a given function and optimize global best position extremes, and outputs the result
sim
- very good simulation implemented by c