资源列表
chengxusheji
- E3 80 8AMATLAB程序设计教程》电子教案-附源代码,挺有用的-Programming Guide
jisuanjihe
- 计算几何算法分析与设计，计算几何算法分析与设计.pdf-Computational Geometry Algorithm Analysis and Design
Gmin
- 利用Fortran语言编制的填充函数法求解全局最优解-Compiled using the Fortran language filled function method for solving the global optimal 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.
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.
gauss
- 高斯消去法求解AX=b，利用对增广矩阵进行的初等行变换，将系数矩阵变为上三角矩阵，然后回带，可以得到方程组的解。-Gaussian elimination method for solving AX = b, using the augmented matrix for the elementary row transformation, the coefficient matrix into an upper triangular matrix, and then back to the ta
crout
- 矩阵的crout分解，将矩阵分解为下三角矩阵和上三角矩阵的乘积，其中上三角矩阵为单位上三角矩阵。-Matrix crout decomposition, the matrix into a lower triangular matrix and upper triangular matrices, in which the upper triangular matrix is the upper triangular matrix.
LUforAX=b
- 利用矩阵的LU分解来计算线性方程组，其中矩阵分解的时候利用的是Doolittle分解。-LU decomposition of matrix to calculate the linear equations, matrix decomposition when the use of which is Doolittle decomposition.
rabin_karp
- An implementation of the Rabin Karp Algorithm to find the longest common sub-sequence between to strings in C.
powmod
- An effecient algorithm to calculate the power mod (b^p)(mod n) using Dynamic Programming
DFAaNFA
- 编译原理，判断一个字符串是否满足由DFA和NFA表示的正则表达式-Compiler theory, to determine whether a string meets represented by the DFA and NFA regex
kth_median
- Kth Median efficient algorithm implementation in C.