2D-Navier-Stokes

MATLAB数据可视化算法教程MATLAB data visualization algorithm tutorial(MATLAB data visualization algorithm tutorial MATLAB data visualization algorithm tutorial)

一个计算用的matlab小程序，希望大家喜欢，谢谢(A calculation of the matlab small program I hope you like it, thank you)

说明：  灰色理论认为系统的行为现象尽管是朦胧的，数据是复杂的，但它毕竟是有序的，是有整体功能的。灰数的生成，就是从杂乱中寻找出规律。同时，灰色理论建立的是生成数据模型，不是原始数据模型，因此，灰色预测的数据是通过生成数据的gm(1,1)模型所得到的预测值的逆处理结果。 此程序用来作灰色预测。 (Gray theory that the behavior of the system even though the phenomenon is dim, the data are complex, but it is after all, is orderly, there is a whole function. Gray number generation, that is, from the clutter to find out the laws. At the same time, the gray theory is to generate data model, rather than the original data model, therefore, gray forecast data to generate data through the gm (1,1) model by the inverse of the predictive value of the results. This procedure is used for gray prediction.)

说明：  分形计算，给出了分形计算的源代码matlab程序，可以迅速帮助大家进行分形的分析与计算，参数容易设置。 (Fractal calculation, given the fractal calculation of the source code matlab procedures, can quickly help you to carry out the fractal analysis and calculation, easy to set up parameters.)

维纳滤波算法，提高信噪比和可读性，适用于平稳高斯噪声环境(Wiener filtering algorithm to improve the signal-to-noise ratio and readability, applicable to stationary Gaussian noise environment)

遗传算法例程：通过MATLAB，以航班调度排序为例，实现遗传算法。(Genetic algorithm routines: the adoption of MATLAB, in order to sort Flight Scheduling as an example, the realization of genetic algorithm.)

最小均方误差自适应算法，简称LMS算法.LMS算法自适应实现 (MMSE adaptive algorithm, or LMS algorithm. LMS adaptive algorithm to achieve)

卡尔曼滤波 简单的程序实现 适合初学者(kalman filter)

We consider the scheduling of simple linear deteriorating jobs on parallel machines a new perspective based on game theory. In scheduling, jobs are often controlled by independent and selfish agents, in which each agent tries to a machine for processing that optimizes its own payoff while ignoring the others. We formalize this situation as a game in which the players are job owners, the strategies are machines, and a player’s utility is inversely proportional to the total completion time of the machine selected by the agent. The price of anarchy is the ratio between the worst-case equilibrium makespan and the optimal makespan. In this paper, we design a game theoretic approximation algorithm Aand prove that it converges to a pure-strategy Nash equilibrium in a linear number of rounds. We also derive the upper bound on the price of anarchy of Aand further show that the ratio obtained by Ais tight. Finally, we analyze the time complexity of the proposed algorithm

arduino due pinout pdf for sam3x8e 非常有用的文档(arduino due for all pinout pdf for sam3x8e)