资源列表
xianxing
- 迭代法线性方程 通过其中一种迭代法解方程 我们的实验报告-Iterative method of linear equations by solving equations in one iteration of our experiment report
feixianxing
- 解线性方程组的迭代法 【实验内容】对实验四所列目的和意义的线性方程组，试分别选用Jacobi 迭代法，Gauss-Seidel迭代法和SOR方法计算其解。-Solving linear equations of the iteration method 【Content】 experimental four experiments listed in the purpose and significance of the linear equations, test were selec
changweifen
- 科学计算中经常遇到微分方程（组）初值问题，需要利用Euler法，改进Euler法，Rung-Kutta方法求其数值解-Differential equations often encountered in scientific computing (groups) of initial value problems, need to use the Euler method, improved Euler method, Rung-Kutta method, to calculate the n
juzheng
- 利用冪法或反冪法，求方阵的按模最大或按模最小特征值及其对应的特征向量。 -Using a power law or inverse power law, seeking phalanx on-die maximum or minimum characteristic values according to model and the corresponding eigenvectors.
shuzhijiweifen
- 实验三 数值积分与数值微分 实验内容：选用复合梯形公式，复合Simpson公式，Romberg算法-Experiment 3 numerical integration and numerical differentiation experiment content: Using composite trapezoidal rule, composite Simpson formula, Romberg Algorithm
project3
- also to say hidden markov pleas see project 1 and2
rom
- Descr iption: Programme to Print first 100 Ramanujan Numbers by TWO WAYS 1st way is printing Ramunajan Numbers from RN taking RN from 0 to INFINITY and print first 100 numbers. 2nd way is to clacualte RN numbers from L M N P of formula
LMaFit-b2
- 递秩矩阵拟合，Matrix Completion ，Sparse Matrix Separation ，Matrix Compressive Sensing -Low-rank Matrix Fitting
full3
- 好不容易收集到的国外小波去燥的文献，希望有些帮助，如有机会翻译成中文上传-Finally gathered outside to dry wavelet literature, want to have some help, if the opportunity to translate into Chinese Upload
fullt4
- 好不容易收集到的国外小波去燥的文献，希望有些帮助，如有机会翻译成中文上传-Finally gathered outside to dry wavelet literature, want to have some help, if the opportunity to translate into Chinese Upload
kalman
- Kalman Filter Implementation using OpenCV
Bubble_S5
- The "binary search algorithm" is one of the quickest way for searching threw an array, the "linear search algorithm" makes "n" comparaisons for searching for an element inside a given array. The "binary search algorithm" only makes log2(n) comparaiso