资源列表
ROMBERG
- ROMBERG加速算法的实现，同时包含梯形方法等，通过比较可以明显看出加速效果。
odd
- 很高效的判断组合数C(n,k)的奇偶性。 巧妙的使用了位运算。时间复杂度为O(1). 避免使用大数类。-Very efficient to determine the number of combinations C (n, k) parity. Clever use of digital computing. Time complexity is O (1). To avoid the use of large numbers type.
Gauss_Seidel
- 数值分析中的高斯——塞德尔迭代算法的的C语言实现-Numerical Analysis of Gauss- Seidel iterative algorithm of the C language
lax2step1
- Hello. The file is presented here is related to the lax 2 step way
DVs
- This code you can use for CPF or CGC validator.
46536524GaussianFilter
- 高斯滤波程序，非常好用，在重力计算和频域内计算中都可以使用-THE GAUSSION FILTER PROGRAMS
f1
- 这是几个常用的测试函数，通过这个测试函数可以比较算法性能的优劣。-This is a test of several commonly used functions, through this test function can compare the algorithm performance is good or bad.
hicks
- 参数化程序hicks函数，主要用于模拟曲线，给定离散点拟合曲线-Parametric program hicks function, mainly used to simulate the curve of a given discrete point fitting curve
honey-rods.tar
- MIT s mpb software simulation for honeycomb lattice of rods -band-gap program-MIT s mpb software simulation for honeycomb lattice of rods -band-gap program
Haep
- 堆排序：编写程序实现对序列{2,3,4,1,5,7,6,8,10,9}}的排序,适合初学者，通俗易懂且正确-Heap Sort: preparation program sort sequence the {2,3,4,1,5,7,6,8,10,9}}, suitable for beginners, easy to understand and correct
fentao
- 五只猴子合作摘了很多桃子，感到累了，决定先去睡觉，醒后再分。不知过了多久，第一只猴子醒了，看见其它猴子都没有醒，就把所有桃子分为五堆，发现多一个，就吃了一个，拿走一堆，把剩下的又堆在一起走了。第2只猴子醒来，以为自己是第一个，也是把桃子分为五堆，也是多一个，就吃了一个，拿走一堆，剩下的又堆在一起走了。第3，4，5只猴子都是这样。现在问总共摘了多少桃子，每只猴子连吃再拿是多少？最后还剩多少？-Five monkeys co-picked peaches, tired and decided to
TwoCircleIntersection
- 两个圆求交点，得到交点坐标，程序简单易懂-The intersection of two circles seeking to obtain the coordinates of the intersection, the program is simple and easy to understand