PotentialField

Galerkin方法,这是一种真正的无网格方法.这种方法采用移动最小二乘函数采近似解变量,并且采用移动最小二乘近似函数的权函数作为加权残值法的权函数.文中对形成的离散动力学方程用Newmark方法求解(Galerkin method, this is a real meshless method. This method adopts moving least squares in function approximation solution variables, and adopts moving least squares approximate function of weight function as a weighted residual method of weight function. In the paper, the discrete dynamic equation formed with Newmark method to solve)

This project deals with modeling and simulation technique of a Dynamic Voltage Restore (DVR).The DVR is a dynamic solution for protection of critical loads from voltage sags / swells. The DVR restores constant load voltage and voltage wave form by injecting an appropriate voltage. Present novel structure improves power quality by compensating voltage sag and voltage swells. The transient response of any natural system is the way in which the response of the system behaves as a function of time. Electromagnetic transient studies have always played an essential behavior of the system in the event of different forms of transient phenomena, which can hardly be achieved by other means. This project addresses the transient studies of electrical networks with embedded, power electronics-based, FACTS and Custom Power (CP) controllers.

现代信号处理中，几种经典算法的编程实现。(Modern signal processing, several classical programming algorithm.)

自学Matlab必备的60个小程序代码，(60 small self-Matlab essential program code)

Anisotropic diffusion in image processing.

用matlab实现Floyd和Wallshell算法，基本功能都有(Floyd and Wallshell using matlab algorithm, the basic function)

Practical FIR Filter Design in MATLAB Revision 1.1 Ricardo A. Losada The MathWorks, Inc. 3 Apple Hill Dr. Natick, MA 01760, USA January 12, 2004

混沌模型logistc映射程序，描述昆虫变化的经典数学模型——虫口模型(Chaos Model logistc mapping procedures, changes in the classic description of insects mathematical model- Population Model)

adding noise and removeing point processing drawing histogram histogram equalization histogram matching spatial filtering

Dijktra s single source shortest path algorithm. The function takes a graph (which may be sparse) as an input and returns the matrix of shortest distances between all of the nodes. Additionally, individual source and sink nodes may be specified as additional arguments.