▍1. wavepacket-cpp-0.1.1b
c++编写的小波包算法,可以实现小波包分解与重构,速度较快(A wavelet packet implementation written in C++, does wavepacket decomposition and reconstruction quite efficiently)
c++编写的小波包算法,可以实现小波包分解与重构,速度较快(A wavelet packet implementation written in C++, does wavepacket decomposition and reconstruction quite efficiently)
fluent模拟焊接,熔滴过渡的质量源项(Welding Simulation, mass source)
用于解决港口优化调度的算例,程序可解,且富有详细说明(The optimal scheduling algorithm used to solve the port, the program is solvable, and rich detailed instructions)
说明: 在进行激光熔覆或者焊接时可用到的移动热源命令流(Command flow of moving heat source available during laser cladding or welding)
基于FFT的海面模拟。能够实现海面的复制,波浪模拟效果较好。(FFT-based simulation of the sea. Be able to achieve replication of the sea, wave simulation better.)
LDL分解法,用于求解大型的线性方程组。此程序中最多能解100维的,速度还不错(LDL decomposition method for solving large-scale linear equations. This procedure can be up to 100 peacekeepers solutions, speed is not bad.)
基于Wegstein方法的求解方程的C++程序。(Wegstein-based method for solving equations C++ program.)
模拟波动方程的有限元程序,计算波场快照,有程序说明!(Simulation of the wave equation, the finite element program, calculate the wave field snapshot, procedural instructions)
随机森林算法,适合初学者阅读,包括公式,资料,调试(Random forests algorithm, suitable for beginners to read, including formulas, data, commissioning)
计算地波传输衰减的程序,可以设置高度,大气条件等(Ground wave transmission attenuation calculation program, you can set the height, atmospheric conditions, etc.)
2D ADI FDTD code.采用不同的三对角矩阵解法(2D ADI FDTD code. Using different tridiagonal matrix method)
详细讨论了INSAR技术中相位解缠最小二乘方法的算法实现;并提出改进的加权最小二乘算法的实现思路(INSAR techniques are discussed in detail in the method of least squares phase unwrapping algorithm and suggestions for improvement of the weighted least squares algorithm implementation ideas)
内点法求解凸二次规划 COPL_QP是一个可用的凸二次规划实验的解。这个软件包试图解决线性约束凸二次规划。源代码用C语言编写,附带用户指南(postscript文件)和问题实例(Interior point method for solving convex quadratic programming)
共轭梯度法求解凸二次规划,代码由C语言开发,老外编写的程序,很值得一读。(Conjugate gradient method for solving convex quadratic programming, code generated by C language development, foreigners prepared program, it is worth reading.)
说明: 共轭梯度法(Conjugate Gradient)是介于最速下降法与牛顿法之间的一个方法,它仅需利用一阶导数信息,但克服了最速下降法收敛慢的缺点,又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点,共轭梯度法不仅是解决大型线性方程组最有用的方法之一,也是解大型非线性最优化最有效的算法之一。 在各种优化算法中,共轭梯度法是非常重要的一种。其优点是所需存储量小,具有步收敛性,稳定性高,而且不需要任何外来参数。(Conjugate gradient method Gradient) is a method between the steepest descent method and Newton's method. It only uses the first derivative information, but overcomes the disadvantage of slow convergence of steepest descent method, and avoids the disadvantage of storing and calculating Hesse matrix and solving inverse of Newton's method. Conjugate gradient method is not only one of the most useful methods to solve large-scale linear equations, but also the most effective method to solve large-scale nonlinear optimization One of the algorithms of. Among all kinds of optimization algorithms, conjugate gradient method is very important. It has the advantages of small storage, step convergence, high stability and no external parameters.)
PoleyFitqw曲3线3拟w合类q库 PolewyFitqw曲w线拟w合t类库 PoelywFitq曲w线拟t合类t库 PoelyFtitq曲er线rw合类t库 PolywrFitq曲q线拟wt合t类库(Pwoly33FiwtPoleetPwolyFit555PolywFit)
说明: PoleyFitqw曲3线3拟w合类q库 PolewyFitqw曲w线拟w合t类库 PoelywFitq曲w线拟t合类t库 PoelyFtitq曲er线rw合类t库 PolywrFitq曲q线拟wt合t类库(Pwoly33FiwtPoleetPwolyFit555PolywFit)
可实现Dijkstra算法,显示起始点到其它各节点的最短距离和路径(Dijkstra algorithm can be implemented to show the shortest distance and path from the starting point to other nodes.)
说明: 可实现Dijkstra算法,显示起始点到其它各节点的最短距离和路径(Dijkstra algorithm can be implemented to show the shortest distance and path from the starting point to other nodes.)