登录
首页 » matlab » matlab11

matlab11

于 2008-04-13 发布 文件大小:2KB
0 190
下载积分: 1 下载次数: 143

代码说明:

  1、 写出此两点边值问题的积分形式; 2、 构造有限元方程; 3、 编程计算显示计算结果。(1, write the two-point boundary value of the integral form 2, structural finite element equation 3, programming calculations show the results.)

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

发表评论

0 个回复

  • avalanche-master
    计算回测程序,多因子选股模型,单因子测试(Calculation of back - test program, multi - factor stock - picking model, the single factor test)
    2021-04-09 18:28:59下载
    积分:1
  • 7-DOF-RIDE-MODEL-test1
    汽车七自由度动力学模型的动力学分析和计算。并对其进行计算(The car seven degrees of freedom dynamic model )
    2021-03-16 20:29:21下载
    积分:1
  • nsolgm
    nsolgm 算法 是求解非线性方程组的一种非常有效而且又快捷的方法(nsolgm algorithm for solving nonlinear equations is a very effective and efficient way and)
    2013-09-13 16:38:29下载
    积分:1
  • bingtaixitong
    对病态系统采用了四阶龙格库塔法和蛙跳法进行了仿真,得到了很好的实验结果(Pathological systems using fourth-order Runge-Kutta method and the leapfrog method for the simulation, the experimental results)
    2012-07-07 09:47:50下载
    积分:1
  • GM2
    说明:  GM(1,1)灰色模型,便于了解其混沌特性,程序很短,由matlab编译,(GM (1,1) gray model to facilitate understanding of their chaotic behavior, a very short procedure, Matlab Compiler,)
    2006-04-26 14:53:58下载
    积分:1
  • AddMatrix
    用三元组表为结构,实现稀疏矩阵的加法并输出。(Achieve sparse matrix addition)
    2014-02-19 19:59:00下载
    积分:1
  • EM
    说明:  这是用matlab实现em算法的程序,简单,易懂,共同学习噢。(EM)
    2010-03-14 17:11:03下载
    积分:1
  • opflatestedition
    基于内点法的最优潮流计算,跟踪中心轨迹内点法最优潮流程序 实现了有功损耗最小的经济分配。(Optimal power flow calculation based on interior point method, the point-of-flight optimal power flow program in the tracking center trajectory achieves the economic distribution with the least active loss.)
    2020-12-22 21:59:06下载
    积分:1
  • hartigansSLC_OpenCV
    hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1) Sequential Leader algorithm: Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY. 1. Select maximum cluster "radius" 2. Start with zero clusters 3. Add each item to be clustered to: * Closest cluster if distance <= r * New cluster if distance to closest cluster > r 4. Compute new center from members in cluster 5. Empty the clusters (keeping the centers) 6. Return to step 3 (until no changes are made)
    2010-02-25 19:28:25下载
    积分:1
  • 一种优化的神经网络字预失真方法
    说明:  基于神经网络的数字预失真技术,即智能DPD(Digital Predistortion Technology Based on Neural Network)
    2019-09-27 20:57:50下载
    积分:1
  • 696518资源总数
  • 106155会员总数
  • 8今日下载