kalmanpzvar

A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.

求复杂网络的节点度的分布和平均节点的度，输入邻接矩阵，输出度的分布(Complicated network node degree distribution and the average node degree, input adjacency matrix, the output distribution of the degree of)

program malab for trensient stability of power system

ARTIFICIAL INTELLIGENCE FILE, WHICH CONTAINS A LESSON ABOUT HOUGH TRANSFORM AND A BASIC ALGORITH IN MATLAB DOING SKELETIZATION AND HOUGH PRINCIPLES.EXCEL CONTAINING A MATRIX ABOUT THE APPLICATION

matlabcode for eegclassification using rcspa

（1）对选定二阶电路图进行仿真，得到仿真的输入、输出数据； （2）建立二阶系统函数，用模拟的方法求解其响应，并用matlab平台求出响应波形； （3）对数据进行拟合； （4）对拟合的结果进行误差分析 ((1) on the selected second order circuit diagram of the simulation to obtain a simulation of the input and output data (2) the establishment of the second order system function, solving the response by the simulation method, and was determined using matlab platform response waveform data (3) be fitted (4) the results of the fitting error analysis)

create a new Boolean object whose default value is the value of the boolean.

交互多模型 用于解决机动目标跟踪 问题(IMM for maneuvering target tracking problem solving)

在用遗传算法解决航天器轨道调度优化任务中，求每天初始生成路径的速度增量与燃料消耗量(solve lambet problem)

说明：  一种改进的BP算法 MAtlab运用于预测(An improved BP algorithm is applied to predict MAtlab)