登录
首页 » matlab » zhiqiejiebaoguo

zhiqiejiebaoguo

于 2014-09-09 发布 文件大小:3KB
0 264
下载积分: 1 下载次数: 70

代码说明:

  枝切法解包裹,可以对包裹相位解包,恢复正常面型(unwrapping method)

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

发表评论

0 个回复

  • MATLAB
    Jacobi, Gauss seidel
    2009-09-23 09:59:31下载
    积分:1
  • BPSO
    变邻域,含变惯性权重策略的自适应离散粒子群算法,完美运行,适应函数是多式联运路径优化实例计算(Variable Neighborhood, Adaptive Discrete Particle Swarm Variable inertia weight strategy perfectly, fitness function is multimodal path optimization calculation examples)
    2017-03-10 23:14:34下载
    积分:1
  • PID_Control_Made_Easy
    PID Controller Design and Tuning with MATLAB and Simulink(This demo file shows new capabilities for PID Controller design and tuning in MATLAB and Simullink)
    2010-01-09 16:42:36下载
    积分:1
  • LAGRANGE
    This is a file.m (Matlab) with the Lagrange method
    2012-06-07 01:46:26下载
    积分:1
  • GA-GUIDE
    Matlab基因遗传的一些入门学习资料和指导(Matlab genetic entry learning and guidance)
    2012-08-24 12:07:28下载
    积分:1
  • Recursive_integer_division
    递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
    2014-02-06 14:21:38下载
    积分:1
  • choleskyjie
    cholesky算法(正定对称矩阵的LL 分解,完整程序)(cholesky)
    2009-12-25 14:55:00下载
    积分:1
  • procesos
    Code in matlab about stocastic proccess
    2009-06-04 06:19:27下载
    积分:1
  • average2
    calculate average in Matlab
    2012-06-08 06:18:27下载
    积分:1
  • eplo2
    calculate gauss into two vectors
    2014-11-14 02:08:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载