登录
首页 » Java » vpm

vpm

于 2007-12-07 发布 文件大小:10KB
0 145
下载积分: 1 下载次数: 58

代码说明:

  二维涡流位置及流场分布计算程序,Vortex Panel Method (Two-dimensional eddy current distribution of the location and flow field calculation program, Vortex Panel Method)

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

发表评论


0 个回复

  • stochastic-computation
    TGM.m \传统的Galerkin方法 MD.m \时滞惯性流形方法 brownian.m \演示布朗运动 randomwalk.m \ 演示随机游走 tumor.m \ 演示tumor演化(TGM.m traditional Galerkin method MD.m Delays inertial manifold method brownian.m demo Brownian motion randomwalk.m demo random walk tumor.m demo tumor evolution)
    2013-08-28 18:00:23下载
    积分:1
  • FDTDMATLAB
    1维等离子体FDTD的Matlab的两种方法(One-dimensional FDTD plasma of the two methods of Matlab)
    2020-09-22 20:57:52下载
    积分:1
  • filter_final
    耦合矩阵旋转MATLAB编码提取切比雪夫滤波器耦合矩阵(coupling matrix rotation)
    2021-03-02 11:09:34下载
    积分:1
  • squarecircfit
    本人编写的基于最小二乘法的圆拟合程序,可直接下载使用。(I prepared the least squares method based on circle fitting procedures, can be directly download.)
    2009-03-18 16:39:05下载
    积分:1
  • 11087 统逆序对
    说明:  Description 设a[0…n-1]是一个包含n个数的数组,若在ia[j],则称(i, j)为a数组的一个逆序对(inversion)。 比如 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。 一个n个元素序列的逆序对个数由三部分构成: (1)它的左半部分逆序对的个数,(2)加上右半部分逆序对的个数,(3)再加上左半部分元素大于右半部分元素的数量。 其中前两部分(1)和(2)由递归来实现。要保证算法最后效率O(nlogn),第三部分(3)应该如何实现? 此题请勿采用O(n^2)的简单枚举算法来实现。 并思考如下问题: (1)怎样的数组含有最多的逆序对?最多的又是多少个呢? (2)插入排序的运行时间和数组中逆序对的个数有关系吗?什么关系? 输入格式 第一行:n,表示接下来要输入n个元素,n不超过10000。 第二行:n个元素序列。 输出格式 逆序对的个数。 输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)
    2019-01-07 23:52:06下载
    积分:1
  • EFG
    这是一个有关解二维弹性板的无网格EFG程序matlab源代码,是学习无网格法入门的必学程序!(This is a solution of two-dimensional elastic plate meshless EFG process matlab source code, is a meshless method to study entry procedures must!)
    2008-03-19 15:56:00下载
    积分:1
  • gauss-seidel
    二维热传导扩散方程的高斯-赛德尔迭代方法。(A two-dimensional thermal diffusion problem using Gauss-Seidel iteration method.)
    2021-01-18 14:28:44下载
    积分:1
  • 自控课设
    说明:  自动控制原理课程设计,建立倒立摆的非线性数学模型用SIMULINK图形库实现。(The course design of the principle of automatic control and the establishment of the nonlinear mathematical model of the inverted pendulum are realized by the Simulink graphic library.)
    2020-06-20 12:31:50下载
    积分:1
  • chirp-Z变换 MATLAB代码.txt
    一个简单的CZT chirp-Z变换例程(a simple example of CZT)
    2019-04-26 10:39:33下载
    积分:1
  • bycgste
    共轭梯度法(Conjugate Gradient)是介于最速下降法与牛顿法之间的一个方法,它仅需利用一阶导数信息,但克服了最速下降法收敛慢的缺点,又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点,共轭梯度法不仅是解决大型线性方程组最有用的方法之一,也是解大型非线性最优化最有效的算法之一(Conjugate gradient method (Conjugate Gradient) is between the steepest descent method and Newton' s method between a method that takes only a first derivative information, but to overcome the slow convergence of the steepest descent method shortcomings, but also avoid the need to store Newton and computing the inverse Hesse matrix and disadvantages, conjugate gradient method is not only to solve large linear equations of the most useful methods, large-scale nonlinear optimization solution is the most efficient algorithms)
    2013-09-13 16:33:21下载
    积分:1
  • 696518资源总数
  • 105282会员总数
  • 11今日下载