利用杜利特路分解求解线性方程组！

求解电磁场的三维有限元算法程序,使用C语言实现.比较高效.-Solving the three-dimensional electromagnetic finite element method, the use of C language. Comparative efficiency.

这是python.It做的小型社交网络需要输入一个字符串，并将其解析，使图形structure.Then我们可以发现连接之间friends.Their喜欢etc.Also我们可以添加新的连接..在这里，上面提到的比赛是这门课程采取项目

巡线系统是让小车按照事先写好的程序让小车沿固定的轨道进行行走（由2个车轮，6个tk-20黑白灰度传感器来实现），当巡线系统上的红外线传感器发现前方的物体时，让巡线系统进入一个中断状态，从而开始机械臂系统的运行，大步进电机下降，电磁铁通电，大步进电机上升过程中，颜色辨别传感器进行识别，然后会指挥小步进电机转固定的角度，放到固定的车身上，然后让大小步进电机还原。然后巡线程序继续执行，依次在与机械臂系统进行联系。如若放到固定位置主要是巡线系统精确停止与机械臂系统精确放置。

cinematic model of a robot with five degree

一个很好的计算器程序-a good calculator program

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive

用差分方法求解沃尔泰拉方程，此处为一个变元的方程，由于该方程同时含有微分和积分，一般求解有一定的困难。-use of the finite difference method for Volterra equation here as a variable element of the equation, As the same time contain differential equations and integral, the general solution is definitely difficult.

本程序采四边形网格法编制了曲面等值线程序，只要输入相应数据，就可绘制出等值线图-the procedures adopted mesh France produced a surface contour procedures, as long as the corresponding data input can be drawn contour map

Learnin Mathematics with the ABACUS Activity-book part 7

无网格伽辽金方法计算源程序(线弹性２D问题)-EFGM source method (2D linear elastic problems)无网格法（Mesh-less method） 无网格方法（Mesh-less method）是在数值计算中不需要生成网格，而是按照一些任意分布的坐标点构造插值函数离散控制方程，就可方便地模拟各种复杂形状的流场。该法大致可分成两类：一类是以Lagrange方法为基础的粒子法（Particle method），如光滑粒子流体动力学（Smoothed particle hydrodynamics，简称SPH）法，和在其基础上发展的运动粒子半隐式（Moving－particle semi－implicit，简称MPS）法等；另一类是以Euler方法为基础的无格子法（Gridless methods），如无格子Euler／N—S算法（Gridless Euler／Navier-Stokes solution algorithm）和无单元Galerkin法（Element free Galerkin，简称EFG）等。无网格方法可以方便地利用坐标点计算模拟复杂形状流场计算，但不足之处是在高雷诺数流动时提高数值计算精度较困难。无网格方法中比较常见的还有径向基函数方法（Radious Basis Function），主要使用某径向基函数（如（MQ）f(r)=r^5）的组合，来逼近原函数。吴忠敏院士在这方面有比较突出的工作。