-
Complex-valued_matrix_derivatives
关于复数矩阵求导的一本经典书籍“Complex-valued_matrix_derivatives”的电子版(About the electronic version of the complex matrix derivation of a classic book " Complex-valued_matrix_derivatives" )
- 2013-04-08 16:00:31下载
- 积分：1
-
Array-1-dimensi(prak-7)
program array 1 dimensi
- 2012-11-26 08:31:23下载
- 积分：1
-
sdfsgsdgseg
关于房屋贷款贷款的计算，包含本息、本金、一次性付款等贷款方式(Calculated on mortgage loans, including principal and interest, principal, and other one-time payment of loans)
- 2013-08-17 15:07:36下载
- 积分：1
-
chazhi
本例实现了插值函数，将不同次数的插值进行了显示，防止了龙格现象，研究生一般以此题为作业。(The cases to achieve interpolation function, the number of different interpolation were shown to prevent the Runge phenomenon, in order to graduate generally entitled operations.)
- 2013-11-14 15:28:33下载
- 积分：1
-
GPS_IMU_Kalman_Filter-master
说明： 详细描述了通过卡尔曼滤波算法对GSP和imu数据进行融合(merge the gps and imu with the kalman)
- 2020-06-08 21:04:02下载
- 积分：1
-
primesieve
pipelined algorithm implementation in a cluster of personal computers with ANSI C of Eratoshenis sieve problem (prime mumbers)
- 2009-06-17 17:37:47下载
- 积分：1
-
PQ_wave_analsys
fft小程序：可用于分析离散值采集数据的谐波含有率，谐波角度等(fft小程序：可用于分析离散值采集数据的谐波含有率，谐波角度等
FFT small program: can be used to analyze the discrete value of the data acquisition of the harmonic content, harmonic angle, etc.
)
- 2016-01-29 21:52:24下载
- 积分：1
-
eular_ode
欧拉法解常微分方程的MATLAB程序M文件。与大家分享(Euler method for solving the M-file of Ordinary Differential Equations MATLAB program. To share with you)
- 2012-03-20 12:01:04下载
- 积分：1
-
Soct
假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。
[需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])
- 2012-06-14 16:25:10下载
- 积分：1
-
KFFT
计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)
- 2013-12-18 22:32:50下载
- 积分：1
