simple_beam

最速下降法就是梯度下降法,可以用于求解最小二乘问题(线性和非线性都可以)。可以说是求解机器算法的最古老、最经典的模型，另一种常用的方法是最小二乘法。(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.)

FDTD Solutions 是一款三维麦克斯韦方程求解软件，可以分析紫外、可见、红外至太赫兹和微波频率段电磁波与具有亚波长典型尺寸复杂结构的相互作用。 FDTD Solutions 使得设计师能够从容地面对光子设计复杂的挑战问题。快速原型制造和高精度仿真大大降低对费用高昂的原型试验的依赖，因而可以对设计概念进行快速评价，进而缩短产品研发周期，降低费用。 FDTD Solutions 可以帮助你成功应对各种复杂的应用，从基础光子学研究，到目前工业界领先应用领域如成像、照明、生物光子学、光伏、以及众多其他应用。(FDTD Solutions is a three-dimensional software for solving Maxwell' s equations, we can analyze the ultraviolet, visible, infrared and microwave to terahertz frequencies of electromagnetic waves having a typical size of subwavelength interaction of complex structures. FDTD Solutions allows designers to calmly face the complex photonic design challenges. Rapid prototyping and simulation precision greatly reduce dependence on costly prototype testing, which can quickly uate design concepts, and thus shorten the product development cycle and reduce costs. FDTD Solutions can help you successfully deal with a variety of complex applications, leading application areas such as imaging, lighting, biophotonics, photovoltaics, and many other applications basic photonics research, the current industry.)

说明：  分形理论计算，粗糙面结合面的法向载荷和法向接触刚度计算(fractal thoetry simulation)

说明：  任意边界结构正交曲线网格生成程序，使用方便简单(Arbitrary boundary structure of orthogonal curvilinear grid generation procedure, easy to use simple)

说明：  C语言编写8个点的FFT程序,在WINTC上编译通过(C language 8 point FFT procedures WINTC compiled through)

java编写九九乘法表 1*1=1 2*1=2 2*2=4 3*1=3 3*2=6 3*3=9 4*1=4 4*2=8 4*3=12 4*4=16 5*1=5 5*2=10 5*3=15 5*4=20 5*5=25 6*1=6 6*2=12 6*3=18 6*4=24 6*5=30 6*6=36 7*1=7 7*2=14 7*3=21 7*4=28 7*5=35 7*6=42 7*7=49 8*1=8 8*2=16 8*3=24 8*4=32 8*5=40 8*6=48 8*7=56 8*8=64 9*1=9 9*2=18 9*3=27 9*4=36 9*5=45 9*6=54 9*7=63 9*8=72 9*9=81 (Multiplication table 1*1=1 2*1=2 2*2=4 3*1=3 3*2=6 3*3=9 4*1=4 4*2=8 4*3=12 4*4=16 5*1=5 5*2=10 5*3=15 5*4=20 5*5=25 6*1=6 6*2=12 6*3=18 6*4=24 6*5=30 6*6=36 7*1=7 7*2=14 7*3=21 7*4=28 7*5=35 7*6=42 7*7=49 8*1=8 8*2=16 8*3=24 8*4=32 8*5=40 8*6=48 8*7=56 8*8=64 9*1=9 9*2=18 9*3=27 9*4=36 9*5=45 9*6=54 9*7=63 9*8=72 9*9=81 )

说明：  数学建模 马尔科夫链的详细讲解 马尔科夫链的详细讲解 数学建模(A detailed explanation of markov chains for mathematical modeling)

包括广义互相关函数GCC时延估计，通过matlab代码，计算加权加速度。( Including the generalized cross-correlation function GCC time delay estimation, By matlab code, Weighted acceleration.)

《计算理论导引》(作者)[美] Michael Sipser(译者)张立昂 王捍贫 黄雄 机械工业2000年2月第1版.pdf(Computational Theory，(Author) [America] Michael Sipser (translator) Zhang Li Ang Wang Hanpin Wong Hung Machinery Industry in February 2000 1st edition. Pdf)

Using Runge-Kutta 10 inoder to solve