资源列表
cg
- 该程序是用共轭梯度法来求解函数的最优化问题，其中一维搜索时采用了0.618法，即黄金分割法-The program is the conjugate gradient method to solve the function optimization problem, one-dimensional search using the 0.618 method, that is, golden section method
FFT
- 时间抽选基-2 FFT及IFFT算法C语言实现-Selected time base-2 FFT and IFFT algorithms C language
cholesky
- Class for Cholesky decomposition in java
L-M
- 列文伯格-马夸尔特算法是最优化算法中的一种，是使用最广泛的非线性最小二乘法！-Levenberg- Marquardt optimization algorithm is the most widely used non-linear least squares method!
Conjugate_gradient_exact
- 最优化方法的共轭梯度法的精确搜索，有二次终止性。-Refine search Conjugate Gradient Method
precise
- 精细积分Fortran90程序，用于非可逆H阵计算，求解一阶常微分方程组。-precise integration Fortran90 procedures for non-reversible H RUF, for a band of ordinary differential equations.
ErrorAnaly
- 通过分析上位机传输过来的的数据，可以有效地分析里面的噪声分量-PC through the analysis over the transmission of data, allowing the effective analysis of the noise component inside
13KFFT
- FFT变换源代码，已经编译通过，可以直接使用
xuanzhuyuanduliteer
- 对任意阶线性方程组进行独立特尔选主元分解，并解出未知数-Of linear equations of arbitrary order to conduct an independent Ritter election PCA decomposition, and solution out of unknowns
root
- 自己在做设计过程中设计的一个求解任意三角函数的函数，希望对大家有用-They are doing the design process designed to solve a trigonometric function of any hope for all of us
methods-for-the-equation
- 用牛顿迭代法 单点弦割法 双点弦割法 牛顿下山法求解非线性方程。- Solve the nonlinear equations with Newton iteration method ， single point string cut method ，double point string cut down， the Newton method method toequations.
shiyan_2.C.tar
- 基于ROOT version5.32.00 的二维积分计算。-basic on ROOT calculation two dimension integral