登录
首页 » matlab » matlab_changweifenfangchengshuzhijie

matlab_changweifenfangchengshuzhijie

于 2012-05-08 发布 文件大小:775KB
0 237
下载积分: 1 下载次数: 2

代码说明:

  常微分方程数值解在matlaB中的实现,压缩包里面包含讲义和源代码。(Often differential equations in MATLAB to achieve compression package which contains the lecture notes and source code.)

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

发表评论

0 个回复

  • Pseudo
    This is a code of Pseudo-Arc Length Continuation Method , the method can be used for solving the nonlinear equations, the principle can re found in some text books. In the code,I prove the agreement of the code with other methods
    2009-03-30 09:40:20下载
    积分:1
  • DFT
    信号与系统试验报告 离散傅立叶变换(DFT)和频谱分析 一、实验内容 1、实验题目 (1)编写DFT、IDFT程序,并验证其正确性(提示:可利用冲激函数进行验证)。 (2)计算信号f(t)=e-at2sin(2∏ft)的离散傅立叶变换(DFT),求其振幅谱,相位谱、振幅最大值对应的频谱(检测主频)以及对发f(t)进行DFT变换的结果实现IDFT变换,并画出图形。 参数选择如下:频率f =30HZ,a=f 2㏑(M),M=2.5 2、通过实验理解信号振幅谱、相位谱的物理意义,掌握DFT、IDFT算法的实现方法。()
    2008-05-07 10:38:59下载
    积分:1
  • New-Microsoft-Word-Document
    Thresholding of i/p image
    2013-12-17 18:57:07下载
    积分:1
  • ag_neural
    Genetic Algorithm + Neural Network for caracteristic optimization(Genetic Algorithm+ Neural Network for caracteristic optimization)
    2009-05-20 19:43:46下载
    积分:1
  • OFDMmod
    ofdm 调制解调算法的matlab源代码(OFDM modulation and demodulation)
    2010-02-07 10:51:16下载
    积分:1
  • 09-11
    this article is used to explain the color segmentation of cells
    2011-01-06 05:41:13下载
    积分:1
  • 5
    说明:  利用Dijkstra算法来求网络图的最短路径,找到从起点P1到终点Pn的最短路径,由于上述算法使用了连接线中点的条件,不是整个规划空间的最优路径,然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整,让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
    2011-05-10 16:03:58下载
    积分:1
  • dtmf2_d
    dtmf with scope simulation
    2012-05-17 16:29:59下载
    积分:1
  • 20104102125258460
    In this paper we discuss the problem of recovering the vertices of a planar polygon from its measured complex moments.Because the given, measured moments can be noisy, the recovered vertices are only estimates of the true ones. The literature offers many algorithms for solving such an estimation problem. We will restrict our discussion to the Total Least Squares (TLS) data fitting models HTLS and STLS and the matrix pencil method GPOF. We show the close link between the HTLS and the GPOF method. We use the HTLS method to compute starting values for the STLS method. We compare the accuracy of these three methods on simulated data. 2005 Elsevier B.V. All rights reserved.
    2010-12-07 21:39:46下载
    积分:1
  • matlab-programming-for-engineers
    Matlab学习资料,很好的一本书,值得学习(Matlab programming for engineers)
    2011-06-16 10:40:21下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载