登录
首页 » matlab » FEMandMATLAB

FEMandMATLAB

于 2009-06-21 发布 文件大小:5399KB
0 214
下载积分: 1 下载次数: 29

代码说明:

  这是一本介绍结构分析的有限元法与MATLAB程序设计的书籍,适合研究生使用。(This is to introduce a structural analysis of the finite element method and MATLAB programming books, suitable for graduate students to use.)

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

发表评论

0 个回复

  • RBFlw12
    这是matla论文,用来计算RBF输出值很有效(This is matla paper, the output value used to calculate the RBF is very effective)
    2010-09-13 15:53:24下载
    积分:1
  • demospf
    滤波程序、利用MATLAB编写,相当好用(Filtering procedure, and use MATLAB to prepare, very easy to use)
    2010-01-02 19:02:04下载
    积分:1
  • an-interior-point-algorithm
    内点法对非凸非线性规划的解法,求得最优化的解。(Interior point method for solution of non-convex nonlinear programming, to achieve optimum solution.)
    2014-08-26 17:38:36下载
    积分:1
  • mohusj
    matlab程序,关于模糊神经网络的,编修正函数,五层网络(matlab program, compiled correction function, five network fuzzy neural network)
    2013-02-28 19:29:42下载
    积分:1
  • DCT-watermarking
    关于向图像中嵌入二值图像作为水印,用的是交换中频系数的方法。(DCT watermarking)
    2012-04-12 21:28:49下载
    积分:1
  • Beam
    Bema analysis by using the finte element method
    2013-09-28 22:00:49下载
    积分: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
  • multi_port
    基于MATLAB的multi_port详解,主要解决的是multi_port的问题()
    2008-04-06 22:02:16下载
    积分:1
  • psosvm
    将SVM与粒子群算法(PSO)相结合,充分利用SVM在处理小样本回归问题上具有的独特优越性及PSO全局搜索优化等特点(SVM and particle swarm optimization algorithm (PSO) combined with SVM, makes full use of the unique superiority and the PSO global search optimization features in small sample regression problems on)
    2015-01-10 11:30:48下载
    积分:1
  • baro-i-stb-reentry_EKF_UKF_DDKF1compare
    these are to set of files. first one is used for baro and inertial integration and the erro of inertial. the second one is used for sim of reentry by use of not only its dynamics but also with EKF observants to control reentry
    2015-04-10 18:27:55下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载