登录
首页 » Fortran » fgidpre

fgidpre

于 2014-05-10 发布 文件大小:2KB
0 333
下载积分: 1 下载次数: 5

代码说明:

  对GID软件的数据进行预处理,用于有限元计算(preprocessing to gid software output data file)

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

发表评论

0 个回复

  • XFEMAbq
    abaqus中扩展有限元(UEL)计算疲劳断裂(extended finite element method (uel)for fracture problems within the finite element software ABAQUS)
    2020-07-27 10:38:40下载
    积分:1
  • lengpui_V8.7
    多元数据分析的主分量分析投影,LZ复杂度反映的是一个时间序列中,用MATLAB编写的遗传算法路径规划。( Principal component analysis of multivariate data analysis projection, LZ complexity is reflected in a time sequence, Genetic algorithms using MATLAB path planning.)
    2017-02-14 22:23:32下载
    积分:1
  • Simpleequationstoachieve
    说明:  利用该方程组求解一般的线性方程组,别且符合数学求解原理(Using the equations of linear equations in general, do not and in accordance with principles of mathematics to solve)
    2010-04-22 10:38:10下载
    积分:1
  • RLS
    RLS algorithm.design by simulink
    2011-07-27 22:19: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
  • Global-Newton-Raphson
    全局牛顿-拉普森方法求解非线性方程组,自动搜索步长,进一步保证了程序的收敛(Global Newton-Raphson method for solving nonlinear equations. The steps can be found automatically. The convergence is better than the common Newton-raphson method.)
    2013-06-27 12:00:34下载
    积分:1
  • 71001
    基于全相位谱分析的相位差频谱校正法,结合了全相位FFT与传统FFT谱分析法。(Phase Difference Correcting Spectrum Method)
    2009-05-19 21:40:09下载
    积分:1
  • 1
    说明:  一维黎曼问题,一维问题,即激波管问题,是一个典型的一维可压缩无黏气体动力学问题,并有 解析解。对它采用二阶精度两步差分格式进行数值求解。(Riemann problem, One dimensional problem, the shock tube problem, is a typical one-dimensional compressible non viscous gas dynamic problem with analytic solutions. It is solved numerically by two order two step difference scheme.)
    2018-04-29 14:56:36下载
    积分:1
  • schur-decomposition(real)
    实对称矩阵的schur分解,编译即可运行,需要文件输入(schur decomposition for real symmetric matrix,the program can run successfully, you need a file for input)
    2016-03-11 16:20:03下载
    积分:1
  • CS多目标
    说明:  布谷鸟多目标算法用来函数寻优,本代码给出了通用版本,能够很好的适应和学习(CS algorithm used to function optimization, this code gives a general version, can adapt and learn well)
    2021-04-17 09:04:42下载
    积分:1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载