登录
首页 » matlab » NLS

NLS

于 2012-03-20 发布 文件大小:1KB
0 282
下载积分: 1 下载次数: 85

代码说明:

  分布傅里叶方法求解光纤中的光传输振幅,求解非线性薛定谔方程(supercontinuum generation with matlab)

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

发表评论

0 个回复

  • Plane_Azimuth_Fre
    基于面阵的信号方位角与频率的联合估计,采用MUSIC算法(Based on the planar array of signal azimuth and frequency of joint estimation using MUSIC algorithm)
    2008-04-15 09:27:44下载
    积分:1
  • signalprocess_radar
    说明:  雷达信号处理部分,包括正交相干检波、脉冲压缩、多普勒处理和恒虚警检测。(Radar signal processing parts, including the quadrature coherent detection, pulse compression, Doppler processing and CFAR detection.)
    2009-09-01 10:55:33下载
    积分:1
  • hdr
    LDR合成HDR图像,比较实用,从别的网站转载过来的。(转载)(LDR HDR image synthesis (reprint))
    2015-01-14 11:25:30下载
    积分:1
  • fuzzy
    说明:  用于模糊控制率的求取,参照了李国勇书中的例子,在运行前,请将文件名改成英文格式(Fuzzy control rates for the strike, with reference to Li Guoyong book example of running before, please format the file name into English)
    2011-04-18 14:25:53下载
    积分:1
  • 非线性拉格朗日函数的迭代解法
    说明:  使用非线性拉格朗日函数迭代法拟合直线方程(the nonlinear Lagrangian function iteration method is used to fit the straight line equation)
    2020-04-08 00:38:45下载
    积分:1
  • matlabxiaobofenxi
    matlab小波分析书籍源码,需要的同学拿去,别客气,嘿嘿,凑字数(Matlab wavelet analysis books code, the need of the students take go to, don t mention it, hey hey, gather together alphanumeric)
    2012-10-26 23:26:00下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • PCAPresentation
    PCA MATLAB CODE AND SLIDES
    2010-12-08 10:37:24下载
    积分:1
  • fingerprint
    指纹图像细节特征提取,为指纹匹配做充分的准备(fingerprint)
    2009-06-07 10:19:54下载
    积分:1
  • qtdecomp
    说明:  用函数qtdecomp对图像进行四叉树分解,可以检测图像的边界(Use function to check the object boundaries ,it is a new method to trace boundaries.)
    2011-03-07 09:31:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载