-
jiachaungchazhi
谐波分析，加窗fft插值算法，幅值校正；多次谐波；峰值搜寻(Harmonic analysis；fft)
- 2015-06-24 10:38:15下载
- 积分：1
-
coplqp.tar
内点法求解凸二次规划
COPL_QP是一个可用的凸二次规划实验的解。这个软件包试图解决线性约束凸二次规划。源代码用C语言编写，附带用户指南（postscript文件）和问题实例(Interior point method for solving convex quadratic programming)
- 2020-06-28 20:40:01下载
- 积分：1
-
drucker-prager
abaqus drucker-prager UMAT字程序(abaqus drucker-prager UMAT subroutine)
- 2021-04-01 17:19:08下载
- 积分：1
-
codes
在图论中的floyed算法程序，可以算两点之间的最小距离(The floyed algorithm in graph theory)
- 2012-09-01 00:31:21下载
- 积分：1
-
CompDam_DGD
说明： 摩擦力是抵抗固體表面，流體層和材料元件相對滑動的相對運動的力。有幾種類型的摩擦：幹摩擦是一種與之相反的力(friction is the force resisting the relative motion of solid surfaces, fluid layers, and material elements sliding against each other. There are several types of friction: Dry friction is a force that opposes the)
- 2020-06-23 10:00:01下载
- 积分：1
-
Soct
假设有一个能装入总体积为T的背包和n件体积分别为w1 , w2 , … , wn 的物品，能否从n件物品中挑选若干件恰好装满背包，即使w1 +w2 + … + wn=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1，8，4，3，5，2}时，可找到下列4组解：（1，4，3，2），（1，4，5），（8，2），（3，5，2）。
[需求分析](Suppose there are a load of the backpack of the total volume of T and n volumes were w1, w2, ... wn items, whether selected from n items a number of exactly filled backpack, even if w1+w2+ ...+ wn = T, find out the solution of all the above conditions are met. For example: when T = 10, the volume of items {1,8,4,3,5,2}, can be found in the following four solutions: (1,4,3,2), (1,4,5 ), (8,2), (3,5,2). [Needs Analysis])
- 2012-06-14 16:25:10下载
- 积分：1
-
KIVA 3V的入门介绍
KIVA 3V的入门介绍、求解控制方程、边界条件、计算网格、控制方程的离散与求解、程序流程。(Getting KIVA 3V introduction, solving equations, boundary conditions, grid computing, control discrete and solving equations, the program flow.)
- 2014-02-04 05:45:54下载
- 积分：1
-
juzhen
复数矩阵的运算、包括乘、除、加、减、求逆等(Including all operations of the matrix)
- 2017-07-22 14:21:04下载
- 积分：1
-
PHR_multiplier_method
《最优化理论与方法》书籍中的乘子法的源程序，该书中的很多案例都用此方法试验过，本代码是一个小案例，将目标函数和约束函数按自己的需求换掉就能进行所期望的运算(" Optimization Theory and Methods" books multiplier method of the source, the book' s many cases are tested using this method, the code is a small case, the objective function and constraints to replace it according to their needs can perform the desired operation)
- 2013-05-28 17:39:02下载
- 积分：1
-
MLS1D_0
一维最小移动二乘法拟合位移场的无网格方法算例。(ONE-DIMENSIONAL MLS APPROXIMATION)
- 2013-03-24 14:26:29下载
- 积分：1
