Q1

以计算机软件MATLAB为操作平台，将数值分析的理论与上机实验相结合，采用数值解法、解析解法和图形可视化显示并举的全新写作手法(MATLAB is a computer software operating platform, the numerical analysis of the theoretical and experimental-on combined use of numerical method, analytical method and graphical visual display simultaneously a new writing style)

频带数字通信中，频带一阶锁相环simulink模型(band digital communications, a frequency band PLL Simulink model)

matlab模糊数学工具箱，包含常见的模糊聚类，模糊预测等，期待和大家一起分享。(The matlab fuzzy toolbox, including common fuzzy clustering, fuzzy prediction, etc., looking forward to share.)

This is IP optimization method examples with nonequality constraints

说明：  fdtd模拟点源在自由空间的传播，PML边界吸收(FDTD simulation of point sources of transmission in free space, PML absorbing boundary)

matlab code for OpenSURF (including Image Warp)

这是自己编的光谱分析程序，里面含有实验数据，下载后请不要当做自己的实验数据，可以作为参考，谢谢合作(This is their series spectral analysis program, which contains experimental data, as their own experimental data Do not download, can be used as reference, Thank you for your cooperation)

matlab编写的全息程序，主要用于计算全息以及数字再现，(matlab prepared holographic program, mainly used to calculate the hologram and digital reproduction,)

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)

本压缩包包含了《matlab大全》中所附例子的源文件，非常适合初学者下载对照联系(The archive contains the " matlab bible" in the accompanying examples of source files, ideal for beginners download control contact)