登录
首页 » matlab » wind_field

wind_field

于 2009-06-06 发布 文件大小:2KB
0 78
下载积分: 1 下载次数: 5

代码说明:

  velocity field using weather code

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • New-Text-Document
    Shows single- and two-stage-decomposition of a sample image, as well as reconstructed branches. The reconstruction error is shown. Also demonstrates that better compression can often be obtained if different thresholds are allowed for different subbands.
    2014-10-27 13:22:35下载
    积分:1
  • FEM
    利用有限元方法求解悬臂梁的振动问题,输入节点数可以算出前六阶振型,计算固有频率(Using the finite element method to solve the vibration problem of a cantilever beam, the input nodes can calculate the first six vibration mode, calculate the natural frequency)
    2021-04-27 14:58:44下载
    积分:1
  • garchfit
    garchfit函数的用法,用于ARMA参数的拟合,给出参数的极大似然估计值。(The function of the usage of garchfit for ARMA parameter fitting, given the parameters of a great likelihood estimate.)
    2013-03-06 13:32:21下载
    积分:1
  • dirrerent--ESPRIT-algorithm
    多种esprit算法的对比仿真分析,通过对比,可以知道哪种算法最适合(Contrast variety esprit algorithm simulation analysis, by contrast, can know what the most appropriate algorithm)
    2013-12-05 22:34:39下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • psat-2.1.7-mat
    一种电力系统分析工具包,非常实用,包括潮流计算,连续潮流等分析(he PSAT (Power System Analysis Toolbox), simulation model and its analysis steps. The feature, component models, network design of the power system, power flow (PF), continuous power flow (CPF), the small signal stability analysis (SSSA), the simulation of the time domain(TD) and simulation steps of PSAT)
    2013-07-10 20:42:35下载
    积分:1
  • TwoMethodsofDevelopingGraphicalUserInterfaceforinp
    MATLAB的两种图形用户界面参数输入方法 MATLAB;图形用户界面;参数(MATLAB graphical user interface parameters of the two input methods MATLAB graphical user interface parameters)
    2010-05-10 17:21:50下载
    积分:1
  • tsp_ga
    tsp with genetic algorithm
    2012-04-29 05:48:03下载
    积分:1
  • huizongjisuanchengxu
    反问题,由采集的温度场计算三种组分的混合物的导热系数和热容(Inverse problem, the temperature field calculation by the acquisition of a mixture of three components of thermal conductivity and heat capacity)
    2013-10-14 21:13:54下载
    积分:1
  • histogram-of-each-part-from-RGB-image
    histogram of each part from RGB image
    2013-09-20 09:20:30下载
    积分:1
  • 696524资源总数
  • 103872会员总数
  • 62今日下载