convolution

常用的算法设计策略(包括分治策略、动态规划、贪心策略、回溯法、随机算法等) 算法复杂度分析方法(计算迭代次数、使用递归方程、频度分析等) (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.))

其基本思想是取B样条函数 为及基函数，在[a,b]中均匀划分区间，xi=a+ih,h=(b-a)/n,由于三次样条函数空间是n+3维的，所以把分点扩充到x-1,xn+1,则任意三次样条函数可用 线性组合来表示：(The basic idea is to take B-spline function and basis functions in [a, b] in the evenly divided intervals, xi = a+ ih, h = (ba)/n, because the cubic spline function is n+3 dimensional space , so the expansion points to the x-1, xn+1, then any cubic spline function can be expressed as a linear combination:)

Maximum Flow Graph (Boykov Kolmogorov Algorithm)

1） 应用C语言编写程序，计算弹道，并绘制结果曲线。 给出系统脱靶量统计结果（用蒙特卡洛法）。 (torpedo)

一个非线性方程的matlap程序，杜芬方程的变异(A nonlinear equations matlap program, variation of Duffing equation)

说明：  气泡上浮实验，基于fluent的二维模型(Bubble Floating Experiment)

用计算机编程的方法建立试卷的合理分配问题的优化模型(Optimization model to establish the papers a reasonable allocation problem with computer programming methods)

有限元计算开源库，可以用于计算动力、静力、磁场等等方面的计算(Finite element calculation open source library)

This file contains a summary of what you will find in each of the files that make up your GPKolmogorov application.

欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数 欧拉角与四元数(you you you you you you you you you you you you you you you you my )