搜索资源列表
kalman
- runs Kalman-Bucy filter over observations matrix Z for 1-step prediction onto matrix X (X can = Z) with model order p V = initial covariance of observation sequence noise returns model parameter estimation sequence A, sequence of predicted
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
finitecal
- 本程序设计了一个有限域类，可以提供GF(P)[P为素数]上的矩阵运算，特别通过欧几里德算法提供了多项式的有限域矩阵逆运算。-This procedure designed a type of finite fields can be GF (P) [P for prime] on matrix calculation, in particular through the Euclidean algorithm provides a finite field polynomial matrix i
P-svWaveFieldSimulationConversion
- 二层地质模型波场模拟,用有限差分进行波场的模拟,充分利用多波多分量地震记录，以及各向异性方面的独特信息，可有效地减少 纵波勘探的多解性，定量地描述裂缝储层，改善某些纵波资料成像不好地区的构造 成像。这样可获得比纵波分辨率高的多波剖面，从而有利于研究小幅度构造、断层、 裂缝裂隙等复杂地质现象，对油气勘探与开发具有现实意义和实用价值-Two-layer geological model wave field simulation, using finite difference wave
AlgoritmRabina_Karpa
- The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text. For text of length n and p patterns of combined length m, its av
c-P-P-algorithm-procedures
- 程序开始运行，要求用户首先输入两个大数。 然后进行菜单选择，进行相应的大数运算。 分析说明：由于大数的范围太大，不能直接定义为int或者float等， 所以我们的想法就是定义成字符串类型， 输入的数字一位一位地存入字符数组里面。 然后在运算的时候也是一位一位地运算。 这个过程就得从最基本的数学运算法则做起，不乏多种判断。 涉及到数组和指针的应用。最难的就是判断情 况还有应用数组和指针过程中出现的多种未可预知的错误， 还得通过逐步调试慢慢找出。我们先从加减
Gravitational-Search-Algorithm-Optimization-for-P
- PID tuning by using Gravitational Search Algorithm (GSA). GSA is new algorithm which is believed can produce a better result compare to other optimization technique
sgu262
- sgu262：Symbol Recognition(状压DP) 题目大意： 给出k个n∗ m的01矩阵Si，求出一个1尽量少的n∗ m的01矩阵P，满足k个矩阵与该矩阵的交互不相同，也就是说通过该矩阵能表示出给出的k个矩阵。-262. Symbol Recognition time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output:
fft
- 用DFT 函数计算电压u, 电流i的基波(f1=50 Hz)的有效值和相位; 用FFT函数分别计算电压u和电流i 所包含的直流,基波和谐波的有效值和初相角; 可计算基波(f1=50 Hz)和各次谐波的功率p和功率因数con?.(The effective value and phase of fundamental wave (f1 = 50 Hz) of voltage U and current I are calculated by DFT function. The effect