资源列表
ffts
- 变步长梯形求积法，并以exp(-x*x)为例计算求积分-Variable Step-trapezoidal quadrature method, and exp (-x* x) as an example for calculating the integral
searchinterzone
- 最优化理论与方法中，不精确一维搜索，与0.618方法相对应-Optimization theory and methods, inexact one-dimensional search.
1
- 生成球面上的均匀分布点。使用变换抽样法。也可以使用masaglia抽样方法-To form a uniform distribution point on the sphere. Use transform sampling method. You can also use the sampling method masaglia
chongji
- 仿真两个共振频率的冲击信号，观察其频谱分析-Impact signal simulation of two resonant frequencies observed spectral analysis
gauss2
- Code to solve linear system with Gauss Seidel method alternate code
max.c
- 求三个数中最大数（分别考虑整数，双精度数，长整数的情况）。-Seeking the maximum number of three numbers (integers considered separately, double, long integer case).
pc
- predicator and corrector 方法求解微分方程初值问题，是很成熟的常用方法。-predicator and corrector method to solve the ODE IVP problem, very useful and accuary
modeling-and-static-analysis-of-suspension-bridge.
- 主要是建立悬索桥的模型，以及对悬索桥进行静力分析。-modeling and static analysis of suspension bridge
ELD
- GAMS coding for ELD, GAMS software
random_walk
- 2D version of Brownian motion. A random walk is similar to markov process, however a markov process has no memory, where a random walk uses an initial state. The next step in the walk does not necessarily depend on your current state but wil
Digital-filtering
- 数字滤波，针对与每次采样后都要求数字滤波，而且采样频率高，所要求计算的指令周期少，返回分权得到的滤波结果。-Digital filtering, for each sample are required and the digital filter, and a high sampling frequency, calculate the required instruction cycle less decentralized filtering result obtained in retu
cholesky
- 该程序实现对20*20矩阵的CHOLESKY分解，并输出分解矩阵。-The program achieved 20* 20 matrix CHOLESKY decomposition and decomposition matrix output.