matlab-code

矩量法(电场结合磁场积分方程) 矩量法(电场结合磁场积分方程) 矩量法(电场结合磁场积分方程)(Method of moments (combined electric field integral equation))

求解四元三次方程组，通过在VC++的编程环境，实现计算的高速运行(Solving four yuan cubic equations by VC++ programming environment, to achieve high-speed operation calculated)

通过采集直流输电线路正负极故障电流信息，实行正负极解耦，用行波进行故障定位( U901A u8FC1 u91C0 u96C6 u76R4 u6D1 u8F93 u7535 u7EBF u8DEF u6B63 u8D1F u6781 u6545 u969C u7535 u6D41 u4D1 u606F uFF0C u5B9E u882C u6B63 u8D1F u6781 U89E3 u806 uFF0C u7528 u884C u6)

说明：  非常好的卡尔曼滤波学习程序。文章中有原题，有解题步骤，有实现程序。适合卡尔曼学习过程中的人。(Very good learning process Kalman filter. The article in the original title, there are problem-solving steps to achieve the procedure. Kalman learning process for people.)

插值、拟合与规划问题 插值、拟合与规划问题(Interpolation, fitting with the planning of interpolation, fitting and planning issues)

改程序是计算出金属表面等离子体直波导的有效折射率随波长和传输长度随波的两色散曲线，另外给定Drude-Lorentzia模型参数给定后，还可以求解介电常数以及画出相应实部和虚部的曲线(This programer is used to calculate Ag relative dielectric constant accroding to the Drude-Lorentzia and sovle the transcendental equation for even illumination. At the same time,it can draw the diagram of relationship between the dispersion curve and the Transmission with the length. )

说明：  相场法材料计算的modelc-alloy 对应的基础代码，自取基础有用(The basic code corresponding to modelc-alloy for phase field method material calculation, useful for self-extraction)

基于配电网络辐射型的前推回代潮流计算程序，包括分层等内容(And backward substitution based on the radiation type of distribution network before flow calculation procedures, including the contents of the stratification)

非圆形离散元程序，通过采用非圆形颗粒实现康转动性能(Non-circular discrete element program, through the use of non-spherical particles achieve Kang rotation capability)

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