Optimal-solution-back-to-France-0-1

基于C环境下的最小二乘法的计算编程算法相当相当实用。(C based on the circumstances of the least squares algorithm for calculating the programming very well.)

说明：  c++语言求解稀疏矩阵方程组的ICCG法源程序。参考：《工程电磁场数值计算分析与综合》 附录（Fortran90）.(c++ solves sparse matrix equations with the ICCG method.Reference: &quot Analysis and Synthesis of Numerical Electromagnetic Field ,&quot Appendix (Fortran90).)

求解KZK方程的VISUAL C++源代码 具有计算速度快，计算精度高等优点。(source code solution of KZK equation visual c++)

用Fluent VOF模型模拟单个小水滴落入盛水的水杯之中(Fluent VOF model simulations using a single drop falling into a water glass)

针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足，本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化，并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率，提高解的精确，同时还保持了较低的计算复杂度，具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)

常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) (Commonly used algorithm design strategies (including the strategy of divide and conquer, dynamic programming, greedy strategy, backtracking method, random algorithm) algorithm complexity analysis (number of iterations, using a recursive equation, frequency analysis, etc.))

EDFA的掺铒光纤长度模拟计算，附3篇相关论文，330mw的980nm泵泵浦，3db的泵浦吸收，12m最佳长度已经的到验证，可作为EDFA设计参考 (EDFA erbium-doped fiber length simulation of three related papers, 330mw of 980nm pump pump pump 3db absorption 12m optimum length has been to verify, can be used as the EDFA design reference)

天线组阵中相位差的递推最小二乘估计与滤波(Phase array antenna group recursive least squares estimation and filtering)

利用表达式求解和栈的只是，设计一个简易的数学题库， 可供小学生作业，并能给出分数。 要求：建立试题库文件，随机产生 n 个题目；题目涉及加减乘除，带括弧的混合运算；随时可以退出；保留历史分数，能回顾历史，给出与历史分数比较后的评价。(Use solving expressions and stack just design a simple math exam, students for the job, and can give a score. Requirements: Create test file, randomly generating n topics topics involving addition, subtraction with parentheses mixing operation ready to quit keep historical scores, can look back at history, and history is given uation scores after comparison.)

基于OpenMP的大型矩阵相乘的算法源码(Based on OpenMP for large matrix multiplication algorithm source code)