shengbomoni

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

这是数值分析中拟上三角法的实现程序,c语言(This is the numerical analysis to be on the triangulation procedures, language c)

利用labiew主程序实现单片机与主机的串口通信，实现温度的采集，然后通过比例积分算法的控制，输出一定占空比的波形驱动电机，实现恒温水箱的控制系统(MCU and host serial communication labiew main program, to achieve the acquisition of temperature, and then through the control of the proportional integral algorithm, the output of a certain duty cycle waveform drive motor, constant temperature water tank control system)

三维 近场－远场 变换 FDTD...........(FDTD near field to far field transmition)

牛顿插值法进行多项式逼近，matlab编译成功，直接可用(Newton interpolation polynomial approximation method, matlab compiled successfully, directly available)

最速下降法就是梯度下降法,可以用于求解最小二乘问题(线性和非线性都可以)。可以说是求解机器算法的最古老、最经典的模型，另一种常用的方法是最小二乘法。(The steepest descent method is the gradient descent method, which can be used to solve the least squares problem (both linear and non-linear). It can be said that it is the oldest and most classical model for solving machine algorithm. Another commonly used method is the least square method.)

说明：  郭照立D2G9(D2G9)

计算离散傅里叶变换的一种快速算法，简称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.)

说明：  三维FMM射线追踪程序，计算得到核矩阵 时间场(Three - dimensional ray tracing program, the calculation of the kernel matrix)

多项式的链表存储表示以及实现多项式的加法(Said polynomial storage list and the realization of polynomial addition)