资源列表
minPowell
- POWELL算法求最小值，可求取多个函数的最小值，速度和精度都很高。-POWELL algorithms seek the minimum, the minimum can be to strike a number of functions, speed and accuracy are high.
minDFP
- 单纯型算法和最速下降法的综合算法，能很快的搜索到最小值。-Simplex algorithm and steepest descent method of synthesis algorithms to quickly search the minimum.
wnnbp
- 一种基于BP算法学习的小波神经网络，是一个学习小波神经网络的很好实例-BP learning algorithm based on wavelet neural network is a wavelet neural network to learn a good example of
MATLAB
- 系统的介绍了MATLAB软件，并用该语言解决了大量的编程问题。-Systematic introduction of the MATLAB software, and use the language to solve a lot of programming problems
Filter1
- Low Pass filter Matlab
chaos
- 混沌模型的Matlab演示程序，这是Rossler、Julia、Lorenz、Mandlebrot函数的Matlab程序-Chaos model Matlab demonstration program, which is Rossler, Julia, Lorenz, Mandlebrot function of Matlab procedures
DeepConstraintBinaryTree
- Deep Constraint Binary Tree 是一种新的二叉平衡树。改源码同时包含了传统的AVL二叉平衡树的实现-Deep Constraint Binary Tree is a new binary balanced tree. To change source code also includes the traditional AVL balanced binary tree implementation of
FFTexample
- Matlab FFT分析，很好很强大，可以代替分析-Matlab FFT analysis, very good very powerful, can replace the analysis of
tree
- 混沌模型的Matlab演示程序，程序是通过迭代运算，形成了一个树叶型的分形结构-Chaos model Matlab demonstration program, the program is through iteration, forming a leaf-shaped fractal structure
jsjh
- 计算几何基本模板，包括点线多边形等基本类型的定义以及一些基本算法。-The basic template computational geometry, including points, lines polygons and other basic types of definitions and some basic algorithms.
zjdd
- 用于计算二维平面上一个点集的最近点对，可以计算100000个点的规模-Used to calculate the two-dimensional plane, a set of points the last points, we can calculate the size of 100000 points
sjpf
- 三角剖分求二维平面上的点集的一个最小生成树，算法复杂度为O(nlogn)。-Seeking two-dimensional triangulation of points on the set of a minimum spanning tree, the algorithm complexity is O (nlogn).