资源列表
Jacobi
- 解线性方程组的雅克比法，可指定精度和迭代次数-Conjugate gradient method for linear equations
huangjin
- #include<stdio.h> #include<math.h> float Function(float x) void main() { float a,b,e float x0,x1,x2,F0,F1,F2 printf("input a ,b ,e \n") scanf(" f f f",&a,&b,&e) x1=b-0.618*(b-a) x2=a+0.618*(b-a) F1=Func
satdesign.rar
- this program to design satellite system (perfect case),this program to design satellite system (perfect case)
5r
- 正五边形上5定点站5人，互相不同速度追逐算法-The regular pentagon 5 sentinel station 5 people different from one another speed chase algorithm
12345
- 大数加减法,采用字符串方法，突破常规程序设计语言的变量类型的限制-REDUCE ADD
Solver_Cosparse_ADMM
- Solver of Alternating Direction Method of Multipliers for analysis model
calrescapind
- this source code is use to calculate resister capacitor and inductor
DCFilter
- High-Pass filter to remove DC component from audio signal.
Source1
- 求实对称矩阵的特征值及特征向量的雅可比法。-Realistic symmetric matrix eigenvalue and eigenvector of the Jacobi method.
TLVS
- Levinson方法求解Toeplitz型方程组 -Levinson method to solve Toeplitz type equations
Quasi-Newton-Methods
- 拟牛顿法(Quasi-Newton Methods)是求解非线性优化问题最有效的方法之一。其实DFP算法、BFGS算法都属于拟牛顿法，即，DFP、BFGS都分别是一种拟牛顿法-Quasi-Newton method (Quasi-Newton Methods) is one of the most effective methods for solving nonlinear optimization problems. In fact, the DFP algorithm, BFGS algo
equations
- 用c++求解对角元素不为零的双对角线线性方程组-Using c++ to solve linear equations double diagonal non-zero diagonal elements