Welcome![Sign In][Sign Up]
Location:
Search - arc length matlab

Search list

[2D Graphicex4

Description: 计算机图形学中,用射线法和弧长法两种方法判断点是否包含在多边形内部(matlab实现) -Computer graphics, the ray method with arc-length method and two methods to determine whether the points included in the polygon internal (matlab realize)
Platform: | Size: 12288 | Author: | Hits:

[matlabasd

Description: 基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 % 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 % 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 % 确定,如此多次迭代,最终得到最小费用最大流.-Basic ideas: to each arc on the unit cost of traffic as some length, with Floyd for the most short-circuit method to determine the 1 percent since the V1 to Vn the most short-circuit and then this as the most short-circuit the expansion of roads, with maximum flow Solving problems to the flow increased to the greatest possible value of this increased traffic flow on the road as soon as possible after the various units arc flows to re- of the cost, so many times iteration eventually be the minimum cost maximum flow.
Platform: | Size: 2048 | Author: xuechaoling | Hits:

[AlgorithmPseudo

Description: This 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 -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
Platform: | Size: 4096 | Author: michael yang | Hits:

[matlabMatlab_zuixiaoerchengfa

Description:   最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.- Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.
Platform: | Size: 5120 | Author: fuhai | Hits:

[matlabMatlab_zuixiaofeiyong

Description: 最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.-Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.
Platform: | Size: 4096 | Author: fuhai | Hits:

[OtherarcLength

Description: 有限元计算控制加载中弧长法(arc-length)的matlab源程序-Loading FEM arc length control method (arc-length) matlab source
Platform: | Size: 4096 | Author: Seven | Hits:

[Industry researchCRISFIELD_AL

Description: MATLAB program for Arc Length Method for the arch problem given in M A Crisfeild.
Platform: | Size: 1024 | Author: chandra prakash | Hits:

[3D Graphicfolysuanf2

Description: 运用 Floyd 算法解决了 Dijkstra 算法无法解决的弧权为任意实数的网络最短路问题,并且给出了Floyd 算法的最短路长与最短路径的 MATLAB 程序,此程序具有通用性。-Floyd algorithm using Dijkstra s algorithm to solve the arc right can not be solved for any real number of network shortest path problem, and gives Floyd algorithm in MATLAB with the shortest length of the shortest path, this program has the versatility.
Platform: | Size: 960512 | Author: 李五 | Hits:

[matlabmatlabhuchangfakongzhi

Description: 这是基于matlab所编的有限元的弧长控制法案例,对大家了解弧长法很有益处-This is a matlab prepared by the finite element method based on arc length control case, for the understanding of the arc length method is very good
Platform: | Size: 19456 | Author: 晨晨 | Hits:

[matlabarc_length_Lam_Morley_modified.m

Description: 这是Lam_Morley修正的弧长法matlab案例,有助于大家对弧长法的理解和学习-This is the Lam_Morley modified arc length method matlab case, help us to understand and Study on arc length method
Platform: | Size: 17408 | Author: 晨晨 | Hits:

[matlabLJnew

Description: 参考吉林大学姜辉一篇论文,采用几何路径规划计算两端弧长的MATLAB m文件-Reference Jilin University Jiang Hui paper, using geometric path planning at both ends of the arc length calculated MATLAB m file
Platform: | Size: 1024 | Author: xl | Hits:

[matlabARC_LENGTH

Description: arc length method is an path follwing method.this code use matlab
Platform: | Size: 149504 | Author: mars1980 | Hits:

[Algorithmarc_length

Description: Arc-length code is sent.
Platform: | Size: 3072 | Author: tizfahm | Hits:

[OtherARC_LENGTH

Description: arc length is solutionb by matllab
Platform: | Size: 148480 | Author: karimi15 | Hits:

CodeBus www.codebus.net