Gaussian-beam-and-fiber-coupling

自己编的卡尔曼滤波器，有兴趣的看下，运行无误(Own series of Kalman filter, interested look, run correctly)

四象限变换器的matlab模型，主要应用于大功率变换。(Four quadrant converter matlab model, mainly used in large power conversion)

MATLAB实现jacobi法程序的源码MATLAB source code to achieve the program jacobi method(MATLAB source code to achieve the program jacobi method)

参加数学建模培训用的matlab教程，有基本用法，还有实例，一个星期之内可以学完，而且会用。 内容如下： MATLAB入门 Matlab作图 线性规划 无约束优化 非线性规划 微分方程 最短路问题 行遍性问题 数据的统计描述与分析 回归分析 计算机模拟 插值 拟合 每讲都包含源码，完全可用。 希望大家多多支持,给个好评。 (Participate in the training of mathematical modeling used matlab tutorial, basic usage, as well as examples of a week to learn End, and will be used. As follows: MATLAB Introduction to Matlab mapping optimization linear programming linear programming differential line shortest path problem over the problem of statistical description and analysis of data, regression analysis, interpolation fitting computer simulation of stresses are included for each source, completely free. Hope you can enjoy, give praise.)

说明：  多光谱图像、 全色图像的融合， 自己备图(Multi-spectral image, panchromatic image fusion)

Matlab有关改进的PSO算法程序基于三种惯性参数改进的粒子群算法程序,并使用测试函数Goldstein进行结果比较(Matlab program for improving the PSO algorithm is based on three inertial parameters improved particle swarm optimization program and use the results of the test functions were compared Goldstein)

esprit算法DOA估计esprit算法DOA估计esprit算法DOA估计(esprit)

(median) Non-Linear Filtering of Images.

说明：  六个傅里叶变换的例子，包括DFT，DTFT等(Fourier transform of the six examples, including DFT, DTFT, etc.)

说明：  本程序是基于方向优先权的机器人最优路径寻找算法，也可用于求解迷宫的最短路径,算法中是以100*100的格点为实例的，其中标0的位置为可行的点，标1的为障碍物，参考者可以根据自己的情况修改场地信息矩阵和起始点、目标点中间的算法不用修改 (This procedure is based on the priority direction of the robot to find the optimal path algorithm can also be used to solve the maze of the shortest path algorithm is 100* 100 grid points for the instance, which marked the location of 0 points as possible, standard 1 for the barrier, reference conditions can modify the site according to their own information matrix and the starting point, target points do not modify the middle of the algorithm)