pq

设r是f(x) = 0的根，选取x0作为r初始近似值，过点（x0,f(x0)）做曲线y = f(x)的切线L，L的方程为y = f(x0)+f (x0)(x-x0)，求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0)，称x1为r的一次近似值。过点（x1,f(x1)）做曲线y = f(x)的切线，并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1)，称x2为r的二次近似值。重复以上过程，得r的近似值序列，其中x(n+1)=x(n)－f(x(n))/f (x(n))，称为r的n+1次近似值(Let r is f (x) = 0 root, select the initial approximation x0 as the r, over point (x0, f (x0)) to do the curve y = f (x) the tangent L, L the equation y = f ( x0)+ f ' (x0) (x-x0), find the intersection of L and the x-axis of abscissa x1 = x0-f (x0)/f' (x0), x1 is called an approximation r. Through points (x1, f (x1)) to do the curve y = f (x) the tangent, and find the intersection of the tangent with the x-axis of abscissa x2 = x1-f (x1)/f ' (x1), x2 is called r the second approximation. Repeat the process, get an approximation of the sequence r, where x (n+1) = x (n)-f (x (n))/f ' (x (n)), as an approximation of r n+1 times)

有限元单元划分 checkgeometry(Finite Element unit division checkgeometry)

在正方形区域内产生均匀分布的随机拓扑,红色信标节点 . 黑色未知节点,初始化节点间距离,跳数矩阵,最短路径算法计算节点间跳数,球每个信标节点的校正值,最小二乘法求未知点坐标(Generate uniformly distributed random topology in the square area, red beacon nodes. Black unknown nodes, the distance between node initialization, hop count matrix, the shortest path algorithm for computing nodes hops, a correction value of a ball each beacon node, the least square method for the coordinates of unknown points )

sources of matlab for finite element method

可行点标记求最佳匹配算法的MATLAB 程序代码 求最小费用最大流算法的MATLAB 程序代码 匈牙利算法的MATLAB 程序代码 遗传算法解决TSP问题的Matlab程序 遗传算法解决非线性规划问题的Matlab程序 (Feasible point marking the best matching algorithm for the MATLAB code for the minimum cost maximum flow algorithm of the MATLAB program code Hungarian algorithm MATLAB code genetic algorithm to solve TSP problems Matlab procedures for genetic algorithm to solve nonlinear programming problems Matlab procedures)

Capacity Analysis of the MIMO Ricean Channel using Replicas

思科公司关于ofdm的入门资料，值得一看，无线通信的新技术(Cisco introductory information on ofdm, worth a look, a new wireless communications technologies)

BFT,正交傅里叶变换，用于检测线性调频斜率的方法。仿真与论文结果一致。(BFT, orthogonal Fourier transform for detecting the slope of the linear frequency modulation method. Simulation results are consistent with the thesis.)

一个基于空时分组编码的MIMO_OFDM通信系统的仿真设计。此系统包括QPSK调制解调，IFFT调制，空时编解码，基于训 练符号的信道估计等通信模块。(A space-time block coding based on the MIMO_OFDM communication system simulation design. This system consists of QPSK modulation and demodulation, IFFT modulation, space-time coding and decoding, based on training symbols such as communication channel estimation module.)

OSCAR is an optical FFT code used to calculate the steady state optical eld circulating in Fabry Perot cavities. The code can integrate non-sperical mirrors and any arbitrary input elds. Recent applications for OSCAR have been: calculation of thermal lensing eect and calculation of diraction loss and cavity eigen modes for mesa beams. One great advantage of OSCAR is the simplicity and exibility of the code, everyone with only minimal knowl- edge of Matlab can easily modied OSCAR code to suit specc purposes.