-
eeglab
说明： 这是一个处理脑电信号的程序，可以辅助脑电信号处理程序的使用(This is a process of eeg signal, can assist the use of eeg signal processing program)
- 2020-09-16 20:47:55下载
- 积分：1
-
LU分解程序
用LU和LDU分解求解方程组，给出了详细说明(The equations are solved by the decomposition of LU and LDU, and the detailed description is given.)
- 2020-11-26 13:49:31下载
- 积分：1
-
arcLength
有限元计算控制加载中弧长法（arc-length）的matlab源程序(Loading FEM arc length control method (arc-length) matlab source)
- 2020-12-14 22:49:16下载
- 积分：1
-
FastICA2.5
说明： 运用固定点算法实现快速的独立成分分析，实现代码为matlab(use of the fixed-point algorithms to achieve rapid Independent Component Analysis, to achieve code-Matlab)
- 2006-04-27 08:47:32下载
- 积分：1
-
beihanguniversityhomework2
北京航空航天大学数值分析大作业第二题，有难度，这可是历年北航研究生转载最多的代码了(Beijing University of Aeronautics and Astronautics numerical analysis of large operating the second question, there is difficulty, this is the most over the years Beihang University Graduate reproduced the code)
- 2010-06-18 19:21:45下载
- 积分：1
-
python-Machine-learning-master
一个机器学习的python文件，里面拥有各种机器学习方法，可以供大家参考(A Python file for machine learning, which has various machine learning methods, can be used for your reference.)
- 2019-04-17 15:21:41下载
- 积分：1
-
BFFusion2a
采用贝叶斯推论的数据融合，将CHAN算法和泰勒算法的结结果经过处理，得到更好的定位结果，已通过测试。
(Bayesian inference using the data fusion, will CHAN Taylor algorithm and the results of algorrithm processed and better positioning of the results of the full source code, has been tested.
)
- 2012-05-20 23:52:30下载
- 积分：1
-
10
说明： Anderson计算流体力学第十章平板超声速流动例子源码(Anderson Chapter 10 supersonic flow example source code)
- 2020-07-29 11:25:04下载
- 积分：1
-
BESOpython
BESO的python程序，对于进行abaqus的二次开发很有帮助，这样可以将有限元单独在abaqus中进行处理，而优化算法则采用python进行编写(BESO python program, for the secondary development abaqus helpful, so that the finite element can be handled separately in abaqus, while the optimization algorithm is written in python)
- 2021-04-05 22:49:03下载
- 积分：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
