crout_algorithm

Newton-Armijo code for scalar equations: Inputs: X = initial iterate, F = function, TOLA = absolute error tolerance, TOLR = relative error tolerance, JDIFF = 0, analytic derivative, syntax: [f,fp]=f(x), JDIFF = 1, forward difference derivative , Output: x=approximate result, HIST = array of iteration history

二阶锁相环 m 文件，运行有图，应用广泛(Second-order phase-locked loop m documents, there are plans to run a wide range)

matlab中值滤波源代码，对于图像处理的人员有一定的参考意义。。(median filter matlab source code for image processing personnel have some reference value. .)

数学建模算法与应用司守奎 (作者), 孙玺菁 (作者)(Mathematical modeling algorithms and applications)

旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm to work out the TSP.)

这个是编的BP神经网络的程序，对于初学神经网络的人有很好的借鉴(This is a series of BP neural network program, for the beginner neural network is a good reference)

use system identification toolbox in MATLAB to identify and estimate the model

ebook for learning c++

The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.

This simulink program simulates the overall performance of Spread spectrum technique.