资源列表
chengxuyuanma
- 基于C++ 一个小型矩阵相乘程序 用C++可直接运行-Based on the C++ A small matrix multiplication program with C++ Can be directly run
jiechengqiuhe
- 求从1到20的阶乘的总和-For 1-20 from the sum of the factorial
FFT(VHDL)
- 数字信号处理fft算法计算，用fpga开发，vhdl语言写成-Digital signal processing fft algorithm using FPGA development, vhdl language
gaoweifangcheng
- 用matlab解高维微分方程组一般少用到,但是最近看了这方面的例子,希望对用到的人有所帮助-Matlab solutions with high-dimensional differential equations in general less used, but recently read examples in this regard, I hope to help people who use
sum
- 是cholesky分解的一种解决方法的源代码-Is the Cholesky decomposition of a solution
nizhen
- 这是求矩阵逆的一种方法的源代码.用的是代数余子式求的-This is the inverse matrix of a method
chol
- 这是 对矩阵Cholesky分解 的一种方法的源代码.-This is the Cholesky decomposition matrix of a method
KPMstats
- KPMstats is a directory of miscellaneous statistics functions written by Kevin Patrick Murphy and various other people
single
- 单纯形算法，实现最简单的单纯形的算法-Simplex algorithm, the realization of the simplest simplex algorithm
call_external
- The C examples for CALL_EXTERNAL
n!
- /* author: qiaoger email: qiaoger@tom.com date: 2008-1-7 question: 求 n! (n<=5000) */-/* Author: qiaoger email: qiaoger@tom.com date: 2008-1-7 question: for n! (N
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.