登录
首页 » matlab » odegalerkin

odegalerkin

于 2013-04-03 发布 文件大小:200KB
0 242
下载积分: 1 下载次数: 11

代码说明:

  This is a galerkin numerical solver. This is a galerkin numerical solver. This is a galerkin numerical solver. This is a galerkin numerical solver.

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

发表评论

0 个回复

  • Tutorial_Matlab
    MATLAB Turorial Package : Contains 6 PDF documents to elaborate detailed functions in MATLAB
    2009-05-27 13:38:20下载
    积分:1
  • work
    matlab用户图形界面用法的一个小例子。用到了文本框、滚动条等控件,对刚开始学习matlab有一定的帮助。(matlab graphical user interface uses a small example. Used in the text boxes, scroll bars, and other controls, just started learning matlab have some help.)
    2013-09-20 10:33:34下载
    积分:1
  • solving
    各种方程的解法,包括代数方程,线性方程组,线性微分方程等等。。(Solution of various equations, including algebraic equations, linear equations, linear differential equations and so on. .)
    2011-04-26 20:44:48下载
    积分:1
  • CSEM
    csem modelling code for one dimension layered earth
    2014-08-14 01:31:33下载
    积分:1
  • IIR
    说明:  归一化后截止频率为0.2的数字低通滤波器,并且能有效滤掉工频干扰,使心电信号有效表达信息。(The normalized digital low-pass filter with a cutoff frequency of 0.2, and can effectively filter out power frequency interference, so that the ECG signal can effectively express information.)
    2018-12-28 12:58:19下载
    积分:1
  • hwindow
    matlab code for hamming windowing
    2009-12-14 11:18:00下载
    积分:1
  • 20060409222636964
    线性规划 包括单纯形法,梯度,牛顿(linear programming including the simplex method, gradient, Newton, etc.)
    2007-05-08 08:59:16下载
    积分:1
  • RS
    说明:  计算HURST指数,自己编写,这是经过修正之后通过变成得出来的结果,网上一般很少有这类文件。(HURST index calculation, write your own, which is revised after the results come through into a very, very few of these files online usually.)
    2011-11-19 16:21:20下载
    积分:1
  • lsb-steganography
    least significant bit insertion is done using matlab..data is hidden in the least significant bit of carrier file.
    2012-02-12 23:58:25下载
    积分:1
  • myACO
    Ant Colony Optimization (ACO) is a paradigm for designing metaheuristic algorithms for combinatorial optimization problems. The first algorithm which can be classified within this framework was presented in 1991 [21, 13] and, since then, many diverse variants of the basic principle have been reported in the literature. The essential trait of ACO algorithms is the combination of a priori information about the structure of a promising solution with a posteriori information about the structure of previously obtained good solutions.
    2017-12-25 17:22:19下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载