登录
首页 » matlab » Plainstrain_PatchTest

Plainstrain_PatchTest

于 2013-12-07 发布 文件大小:2KB
0 194
下载积分: 1 下载次数: 2

代码说明:

  This code is used for patch test of plain strain in FEM.

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

发表评论

0 个回复

  • 0071371699
    Microsystem packaging
    2010-11-22 00:54:25下载
    积分:1
  • Motion_compensation_coding
    对序列图像进行运动估计,然后进行运动补偿(Motion estimation of image sequences, and then motion compensation )
    2010-12-19 16:48:22下载
    积分:1
  • fdtd2d_plane_wave_obliq
    code about fdtd gooood5
    2011-07-14 14:55:15下载
    积分:1
  • BPSK-GUI
    获取图象并直接在GUI的界面上显示,Matlab代码实现了一个调制的GUI界面,实现BPSK调制算法的源代码。(To acquire images directly in the GUI interface, Matlab code implements a GUI interface modulation BPSK modulation algorithm source code.)
    2012-10-04 22:28:59下载
    积分:1
  • PSOMADS0
    该算法是粒子群算法和网格直接搜索算法的结合,具有稳定性高的优点。(This is a combination of particle swarm optimization algorithm and grid direct search algorithm.)
    2021-04-07 16:29:01下载
    积分:1
  • DSB_cyclic_spectal
    该程序利用MATLAB仿真画出了了DSB信号的循环谱,程序中添加了解释,方便理解和阅读。(The program utilizes MATLAB simulation depicts the cyclic spectrum DSB signal, the program has been added to explain, easy to understand and read.)
    2014-11-04 09:30:22下载
    积分:1
  • 0-1programming
    0-1整数规划有很广泛的应用背景,比如指派问题,背包问题等等,实际上TSP问题也是一个0-1问题,当然这些问题都是NP问题,对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的,本程序只不过是一个练习,得意之处是用递归法把所有解都排列出来。另:胡运权所著的《运筹学基础及应用(第三版)》第97页的例3,我用本程序求解得到的结果是:最优解是x*=(1,0, 0, 0, 0),最优值是f(x*)=8,但书求得最优解是x*=(1,0, 1, 0, 0),最优值是f(x*)=4,是不是书中写错了,请大家验证。以下是源程序,大家可以任意使用无版权问题,另外,如果大家有大规模的0-1规划的问题也希望提供给我,谢谢。变量个数至少是3个(0-1 Integer Programming is a very broad background, such as assignment, bags and so on. actually TSP is a 0-1, of course, these problems are NP, for larger problem with the law is not exhaustive approach in an acceptable time frame to obtain the optimal solution. this procedure is only one practice, farewell tour is the method used recursive all of the solutions to show. Another : Hu Yun-author of "operational research, and application base (third edition)" Article 97 of the three cases, I use this procedure to solve the result is : is the optimal solution x = (1,0, 0, 0, 0), the optimal values of f (x*) = 8, but the book is to find the optimum solution x = (1,0, 1, 0, 0), the optimal values of f (x*) = 4, the book is not a mistake, please certification. Following is the source)
    2006-07-01 10:33:18下载
    积分:1
  • Porjection1
    变分不等式求解算法之一,投影算法是将变分不等式的解进行投影,然后进行迭代。(One of the variational inequality solution algorithm, the projection method for variational inequality solution to the projection, and then iterate)
    2012-05-15 12:35:56下载
    积分:1
  • example1
    人工鱼群算法在优化配置中的应用,可以对参数进行优化选择(AFSA applications optimized configuration, you can choose to optimize the parameters)
    2015-01-04 15:41:49下载
    积分:1
  • modelisation
    modelisation machine asynchrone
    2013-05-15 06:45:07下载
    积分:1
  • 696518资源总数
  • 105595会员总数
  • 1今日下载