-
LS6P
最小二乘法(LS)仿真6个参考节点定位一个定位节点,利用RSSI与距离转化的公式求解距离。(Least squares (LS) simulation 6 reference node positioning a positioning node, the use of RSSI and distance into the distance formula to solve.)
- 2011-11-23 10:14:11下载
- 积分:1
-
code
排样算法,用于矩阵排样优化,仅供参考,有错误请原谅,( ⊙ o ⊙ )啊!(Nesting algorithms for matrix layout optimization purposes, there is an error, please forgive me, (⊙ o ⊙) ah!)
- 2015-05-02 15:41:07下载
- 积分:1
-
hw03_solution
n of the parity check matrix
- 2012-10-08 09:38:42下载
- 积分:1
-
公约数
用C语言实现计算两个数字的最大公约数,代码简单简洁,适合初学者学习。(C language is used to calculate the maximum common divisor of two digits. The code is simple and concise. It is suitable for beginners to learn.)
- 2020-06-21 16:20:01下载
- 积分:1
-
matlab版本的动态非结构网格划分程序
matlab版本的动态非结构网格划分程序,希望对你们有用,欢迎下载。(matlab version of the dynamic non-structural meshing program, I hope useful to you, welcome to download.)
- 2012-12-05 13:41:25下载
- 积分:1
-
cohesive element模拟复合材料损伤-VUMAT
ABAQUS扩展子程序开发,用于计算模拟(ABAQUS extended subroutine application)
- 2021-03-15 20:19:22下载
- 积分:1
-
methode
this document contains an explanation of mathematical functions
- 2013-06-07 15:57:10下载
- 积分:1
-
Sod
利用5阶WENO有限差分法求解一维Euler方程组,给出求解Sod型激波管问题的详细程序。(The use of 5-order WENO finite difference method for solving one-dimensional Euler equations given type of shock tube problem solving Sod detailed procedures.)
- 2014-02-07 11:03:08下载
- 积分:1
-
qk_AG
捷联惯导卡尔曼滤波算法初始对准,参考哈工程的硕士写的,效果可以,但是不知道观测量是如何构造的。(Kalman filter algorithm SINS initial alignment, Master of Engineering Reference Kazakhstan write, the effect can be observables but do not know how to construct.)
- 2012-09-22 22:57:27下载
- 积分:1
-
单纯形法Matlab程序-2016-11-17
一般线性规划问题具有线性方程组的变量数大于方程个数,这时会有不定的解。当决策变量个数n和约束条件个数m较大时,单纯形法是求解线性规划问题的通用方法。
从线性方程组找出一个个的单纯形,每一个单纯形可以求得一组解,然后再判断该解使目标函数值是增大还是变小了,决定下一步选择的单纯形。通过优化迭代,直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems.
Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
- 2018-03-27 17:22:03下载
- 积分:1