搜索资源列表
newton
- 牛顿迭代法，与传统意义上的迭代法类似，只是将f(x)进行泰勒级数展开，只保留前两项，然后进行迭代。其迭代方程为x_(k+1)=x_k-(f(x_k))/(f^' (x_k))。 从编程上来讲，以上述方程对固定范围的复数域中的每个点作为初始点进行迭代，每个点都会收敛到该方程的一个解，对不同的解涂抹不同的颜色，就会看出其收敛范围。如果想得到其精确解所在位置，可通过到达给定精度的迭代次数进行判断，因为该点越接近精确解，其迭代速度越快。以下对老师提供的程序和自己写的程序进行一下对比，选用方程为：y=x
graphene
- 计算石墨烯介电常数的方法，在泰勒赫兹波段的(Method of calculating the dielectric constant of graphene in the Taylor Hertz band)
Copy_2_of_top88_2
- 基于随机有限元法的结构柔顺度期望优化设计模型。将基于泰勒展开的随机有限元法引入到拓扑优化柔顺度期望的求解中来(A stochastic finite element method (random finite element method) is used to design the optimal design model of structural flexibility. The stochastic finite element method based on Taylor expans
code1
- UDP and TCP 可以使用这个文件来运行任何tcp和udp，然后做成后端和前端(The server communicating with the client is called AWS (Amazon Web Server). The three backend servers are named Back-Server A, Back-Server B and Back-Server C. Back-Server A can compute x2 , Back-Server B
Series
- Taylor Sreies and Stem graphic teachnique
diedaifa
- 牛顿迭代法（Newton's method）又称为牛顿-拉夫逊（拉弗森）方法（Newton-Raphson method），它是牛顿在17世纪提出的一种在实数域和复数域上近似求解方程的方法。多数方程不存在求根公式，因此求精确根非常困难，甚至不可能，从而寻找方程的近似根就显得特别重要。方法使用函数f(x)的泰勒级数的前面几项来寻找方程f(x) = 0的根。牛顿迭代法是求方程根的重要方法之一，其最大优点是在方程f(x) = 0的单根附近具有平方收敛，而且该法还可以用来求方程的重根、复根，此时线性收敛
卡尔曼定位程序
- 利用chan,taylor,fang,si等定位算法结合卡尔曼滤波实现通信定位(Using Chan, Taylor, Fang, Si and other positioning algorithms combined with Calman filter to realize communication location)
SU_DiffSNRThree2
- 比较了单用户情况下，3D MIMO的容量与Taylor简化的容量进行对比(Comparing the single-user case, 3D MIMO's capacity is compared to Taylor's simplified capacity)
Taylor_3D_SUMU_DR_Capacity
- 3D MIMO下，比较了单用户和多用户下Taylor简化的容量(In 3D MIMO, the simplified capacity of Taylor under single-user and multi-user comparison is compared)
333
- 牛顿法是一种在实数域和复数域上近似求解方程的方法。方法使用函数f (x)的泰勒级数的前面几项来寻找方程f (x) = 0的根。牛顿法最大的特点就在于它的收敛速度很快。(The Newton method is a method to approximate the equation in the real and complex domain. The method uses the first few of the Taylor series of the function f (x) to
matlab
- 泰勒加权天线matlab仿真，简单线天线泰勒加权(Taylor weighted antenna matlab simulation, simple line antenna Taylor weighting)
nihe
- [1] 对 sin2pix进行在x=0进行泰勒展开 [2] 曲线拟合 python(curve fitting Taylor expansion sin(2pix))
D_T_calculator
- 缝隙天线阵列的泰勒分布及偏置计算 %输入参数： %N为阵元数，切比雪夫多项式阶数为N-1 %R0dB为副瓣电平要求 %输出参数： %角度：0-180° %道尔夫-切比雪夫相对幅度方向图SudB %道尔夫-切比雪夫相对激励幅度值In__ %均匀激励相对幅度方向图s0(Taylor distribution and offset calculation of slot antenna array)
hybrid_snr_taylor_compare
- 毫米波系统混合预编码器泰勒级数近似算法及比较(Approximate algorithm and comparison of Taylor series of mixed precoder in millimeter wave system)
47206
- 多项式插值求解 案例 希望有所帮助 ， 自带案列 和图(The program should include a function generalInterpolation(fs,xs) that finds the interpolating polynomial including in cases where there are repeated points (inlcuding Hermite interpolation, where the points are doubled,
Taylor_calculator
- matlab综合 线性阵列天线 泰勒综合方法 天线阵列(Matlab integrated linear array antenna Taylor synthesis method, antenna array.)
ch.21.CRC book
- chapter 21 in book , Shaping the Future of ICT: Trends in Information Technology, Communications Engineering, and ManagementPublisher: CRC Press Taylor & Francis, USA. "Efficient Two-Stage Sensing Method for Improving Energy Consumption in C
code
- 输入骨架点，得出系数，基于泰勒展开式和高斯消元法(Enter the skeleton point, derive the coefficients, based on Taylor expansion and Gaussian elimination)
Taylor_TOA_AOA_3D
- 三维TOA/AOA定位的泰勒级数展开最小二乘算法MATLAB源代码(Three dimensional TOA/AOA positioning Taylor series expansion least squares algorithm MATLAB source code)
chan-taylor-fang算法比较
- 对比了三种经典算法，用于二维定位，分析了精度(Three classical algorithms are compared for two dimensional positioning, and the accuracy is analyzed.)