MATLAB-Tutorial

solve boundary value problem of Cousera课程Scientific Computing的Lecture 6对应的Quiz中Question 1的求解程序。 求解常微分方程的边值问题。 y =-4y (y of Theory: y=0.5*sin(2x)) x∈[0,1] BC: y(0) = 0 y (1) = cos(2). (solve boundary value problem of Cousera course Scientific Computing' s Lecture 6 corresponds Quiz Question 1 in the solution process. Solving boundary value problems for ordinary differential equations. y' ' =-4y (y of Theory: y = 0.5* sin (2x)) x ∈ [0,1] BC: y (0) = 0 y ' (1) = cos (2).)

贝叶斯分类器源代码．能很好的实现分类．是很好的学习资料．期望与大家一起分享．(Bayesian classifier source code. Can achieve very good classification. Is a very good learning materials. Look forward to working with you to share)

This program is to find the local peaks in the signal.

基于压缩感知的自适应干扰抑制算法.PDF(Adaptive interferenc emitigation algorithm based on compressed sensing)

OFDM系统仿真 加入循环前缀 加燥 绘制误码率能量谱等(OFDM system simulation by adding cyclic prefix and drying to draw the error rate energy spectrum, etc.)

Often it is necessary to add some logical control to a MATLAB algorithm to allow the generated hardware to function correctly in the overall system. This lab exercise will explore how hardware control can be added to a MATLAB algorithm and synthesized using AccelDSP Synthesis.(Often it is necessary to add some logical co ntrol to a MATLAB algorithm to allow the generat ed hardware to function correctly in the overal l system. This lab exercise will explore how har dware control can be added to a MATLAB algorithm and synthesized using AccelDSP Synthesis.)

this is a matlab code for quantom pso algorithm coding.

This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem Genetic Algorithms Binary representation Path representation Adjacency representation Ordinal representation Matrix representation Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...

自己编写的SSSC模型，使用了重复控制器，消除了稳态误差(The module of SSSC with the apply of Repeat Controller)

this file is about beam forming with adaptive file