BigNumber

基于GWBASIC实现的无约束寻优算法，内附GWBASIC主程序和说明(Non-binding on GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC)

14节点牛拉算法计算潮流程序，用于电力系统的潮流计算程序，可以直接用于潮流计算，也可以用于学习潮流计算的流程和方法。(For power flow calculation program, can be used directly flow calculation can also be used to study flow calculation processes and methods.)

罚函数法 它将有约束最优化问题转化为求解无约束最优化问题: 其中M为足够大的正数, 起"惩罚"作用, 称之为罚因子, F(x, M )称为罚函数.(hunhefahanshufa)

说明：  自己编的，实现l-bfgs解无约束优化问题(Own, and the realization of l-bfgs Unconstrained optimization problems)

说明：  球形粒子Mie 散射用Matlab编写的Mie theory计算程序。在光子学中运用广泛，使用非常方便(Mie scattering of spherical particles prepared by using Matlab program Mie theory. In the use of photonics in a wide range of very convenient to use)

In this section we introduce the idea of Galerkin approximations by considering a simple 1-d boundary value problem

用matlab实现的改进的布谷鸟算法——SDCS，它是将最速下降法与CS相结合的(Matlab implementation of the improved algorithm of the cuckoo- SDCS , it will steepest descent method with CS )

计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)

牛顿插值算法，利用数组存储均差表，一步步迭代求得插值(Newton interpolation algorithm, the use of array stores are differential gauge, step by step, iterative get interpolation )

理想流体势流的有限元求解程序,简单易懂，适合初学者对该方法编程的一个初步认识,程序内有详细的注释(Potential flow of ideal fluid finite element solver, easy to understand, this method is suitable for beginners programming a preliminary understanding of the program with detailed notes)