登录
首页 » matlab » Iteration_method

Iteration_method

于 2020-12-23 发布 文件大小:2KB
0 223
下载积分: 1 下载次数: 36

代码说明:

  重建CT图像,ART、SART、OSEM、MLEM算法(ARTalgorithm, SARTalgorithm, OSEM algorithm, MLEM algorithm.)

文件列表:

Iteration_method.m, 5695 , 2018-07-06

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

发表评论

0 个回复

  • MATLAB-Demystified
    在Matlab的统计和优化工具箱中有相关的处理函数(We begin our tour of MATLAB by considering the basic structure of the user interface. We’ll learn how to enter commands, create fi les, and do other sorts of mundane tasks that we’ll need to know before we can tackle solving mathematics problems.)
    2014-12-05 10:40:49下载
    积分:1
  • yinpinchuli
    用matlab实现音频处理功能,两个音频文件模和相位互换,比较互换之后的音频文件的效果(using Matlab achieve audio processing functions, two audio files modulus and phase swap Comparing the exchange of audio files after the results)
    2007-05-15 08:46:52下载
    积分:1
  • bp
    说明:  bp算法,进行预测算法。代码齐全可用,只需修改文件位置即可(BP algorithm, the prediction algorithm. The code is complete and available. You only need to modify the file location)
    2019-12-01 17:11:30下载
    积分: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
  • investment-program
    说明:  模拟三人投资策略分析,最后给出比较策略的方法(Simulation analysis of three investment strategies, the methods are given comparative strategy)
    2011-04-04 14:34:16下载
    积分:1
  • Ejemplo-Filtro-Subbandas
    subband filter in matlab.
    2011-11-14 23:39:03下载
    积分:1
  • signal-processing
    采用自适应信号处理技术的低成本回波抵消器(Adaptive signal processing techniques echo canceler cost)
    2013-12-09 13:35:35下载
    积分:1
  • lab-2
    simple matlab interface some text, edit, radio, popup buttons
    2011-12-20 00:05:59下载
    积分:1
  • Advanced-Kalman-Filtering
    英文原版电子书,kalman滤波高级教程(English original kalman filtering and advanced tutorials)
    2015-03-18 22:29:30下载
    积分:1
  • ivdf_fusebundle_nt_en
    mat lab tool for k-median algorithnm
    2010-01-11 17:57:36下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载