PARALLEL ITERATION FOR SPLITTING FACTORS OF POLYNOMIALS

In this paper we consider some parallel iterations for splitting quadratic factors of polynomials and their convergence.

Iterative circle fitting based on circular attracting factor

An intuitive method for circle fitting is proposed. Assuming an approximate circle(CA,n) for the fitting of some scattered points, it can be imagined that every point would apply a force to CA,n, which all together form an overall effect that "draws" CA,n towards best fitting to the group of points. The basic element of the force is called circular attracting factor(CAF) which is defined as a real scalar in a radial direction of CA,n. An iterative algorithm based on this idea is proposed, and the convergence and accuracy are analyzed. The algorithm converges uniformly which is proved by the analysis of Lyapunov function, and the accuracy of the algorithm is in accord with that of geometric least squares of circle fitting. The algorithm is adopted to circle detection in grayscale images, in which the transferring to binary images is not required, and thus the algorithm is less sensitive to lightening and background noise. The main point for the adaption is the calculation of CAF which is extended in radial directions of CA,n for the whole image. All pixels would apply forces to CA,n, and the overall effect of forces would be equivalent to a force from the centroid of pixels to CA,n. The forces from would-be edge pixels would overweigh that from noisy pixels, so the following approximate circle would be of better fitting. To reduce the amount of calculation, pixels are only used in an annular area including the boundary of CA,n just in between for the calculation of CAF. Examples are given, showing the process of circle fitting of scattered points around a circle from an initial assuming circle, comparing the fitting results for scattered points from some related literature, applying the method proposed for circular edge detection in grayscale images with noise, and/or with only partial arc of a circle, and for circle detection in BGA inspection.

Simultaneous Determination of Rare Earth Elements by Dual-System Iterative Target Transformation Factor Analysis

Dualcolor systems were used to reduce the collinearity of multicomponent spectra, which is described by the angles between spectra vectors. Combined with iterative target transformation factor analysis, single rare earth element was determined in its mixture. The calculated results show that the average angle between rare earth spectra in one color system(trichloroarsenazorare earths, pH 34) is 45, and that in two color systems(trichloroarsenazorare earths, pH 34, 14) is 215. This technique makes it easy to select the real number of the components in mixtures, and the determination results show dualcolor system method is an effective technique in rare earth mixture analysis.

Personnel Localization Method in Transformer Substation Based on Factor Graph

A SINS/GNSS location method based on factor diagram is proposed to meet the requirement of accurate location of substation construction personnel. In this paper, the inertial autonomous positioning, carrier motion information acquisition and satellite positioning technologies are integrated. The factor graph method is adopted to abstract the measurement information received by inertial navigation and satellite into factor nodes, and the state information into variable nodes, so as to construct the SINS/GNSS construction personnel positioning fusion factor graph model. The Gauss-Newton iterative method is used to implement the recursive updating of variable nodes, and the optimal estimate of the location information of the construction personnel is calculated, which realized the high precision location of the construction personnel. The factor graph method is verified by pedestrian navigation data. The results show that the factor graph method can continuously and stably output high-precision positioning results, and realize non-equidistant fusion of SINS and GNSS. The positioning accuracy is better than Kalman filter algorithm, and the horizontal positioning accuracy is less than 1 m. Therefore, the factor graph method proposed can provide accurate location information for substation construction personnel.

天基信息传输高效低复杂度LDPC译码算法研究

军事卫星通信由于需满足信息实时性、传输速率高、通信容量大以及符合星间链路信道的时变特性等要求,通常采用高编码增益、高吞吐量的信道编码方案。低密度奇偶校验(Low-Density Parity-Check,LDPC)码由于具备接近Shannon极限的优异纠错性能和可并行计算的特性成为卫星通信主导信道编码标准之一。目前卫星通信接收机的译码器模块设计仍存在诸如无法实时在线判断迭代停止、系统吞吐量受限、大量判决电路影响核心译码电路的低功耗和实时性等问题。考虑上述问题,以因子图模型为基础,针对空间数据系统咨询委员会(Consultative Committee for Space Data Systems,CCSDS)标准深空通信码型,将校验节点归一化满足概率进化图案与LDPC译码器状态紧密耦合,给出可实时在线判断迭代停止的最优停止准则,实现高性能、低复杂度的停止准则译码算法设计。当优先考虑高吞吐量时,误码率(Bit Error Rate,BER)性能退化0.13 dB,中低信噪比平均迭代次数(Average Number of Iteration,ANI)降低50%以上;当优先考虑纠错性能时,BER性能仅退化0.02 dB,同时大幅降低ANI。该译码算法为高效低复杂度LDPC译码器设计提供有效解决方案。

基于分区刚体-界面元方法的重力坝深层抗滑稳定分析

将坝体及坝基系统分界为可变形滑动界面、刚性滑动块体和刚性基床三部分,建立了基于滑动界面应力变形协调、分区刚体静力平衡的分区刚体—界面元分析方法,其未知量仅包含分区刚体变形及滑动界面上的接触力。结合基于极限平衡方程的迭代解法,可快速准确求解重力坝深层抗滑稳定安全系数。对局部滑面未知情形,可通过搜索求解最危险滑动面。该方法可同时满足上限极限分析的运动许可条件和下限极限分析的应力许可条件,克服了现有规范分析方法通过假定来满足下限极限分析条件的缺点。最后通过某重力坝深层抗滑稳定分析算例验证了该方法的准确性。

求解PageRank向量的一种松弛多步分裂迭代方法

基于求解PageRank向量的内外迭代格式,引入一个松弛因子得到一种松弛内外迭代方法。结合已有的多步分裂迭代框架,引入两个不同的松弛因子,提出了求解PageRank向量的松弛多步分裂迭代方法并分析了算法的收敛性。更进一步地,利用松弛内外迭代格式构造了加速投影子空间方法的预处理矩阵,理论分析相关谱分布情况,并给出了松弛多步分裂迭代方法及预处理矩阵中参数的选取准则。几个数值例子验证了松弛多步分裂迭代方法和预处理矩阵的有效性,通过选取合适的松弛因子,与多步分裂迭代方法相比具有更高的运算效率。

ITER TF导体室温氮气流动阻力实验研究

对国际热核聚变实验反应堆纵向场(ITERIF)导体室温氮气流动阻力进行了理论计算,在计算的基础上设计了1套ITER导体流动阻力实验平台,然后利用这个实验平台对1根78m长的ITERTF导体进行了室温下氮气流动阻力实验,得到实验值和计算值的最大偏差为10%;同时对实验得到的雷诺数和摩擦系数的关系进行了重新拟合,得到了新的摩擦系数经验关系式;最后对ITERTF导体低温下的流动阻力进行了理论计算,得到TF导体超临界氦流动阻力约为441Pa/m。

基于GNSS/UWB的多无人机协同定位技术

针对多无人机之间位置信息的求解问题,提出基于GNSS/UWB的分布式协同定位方法,并基于因子图理论构建了一套分布式数据融合框架,在无人机之间引入消息传送与接收以实现信息共享,然后采用和积算法求取无人机节点位置信息的边缘概率密度函数。设计了基于改进EKF的迭代滤波器对无人机状态进行估计,对算法进行仿真。仿真结果表明,该分布式协同定位算法有着接近于集中式协同定位算法的定位精度,并且优于单点独立定位算法的定位精度。

改进麻雀搜索算法的飞行器航迹规划

针对传统麻雀搜索算法(SSA)在飞行器航迹规划求解问题中计算过程复杂、易陷入局部解等不足,提出了一种融合鲸鱼搜索因子和柯西-高斯变异的麻雀搜索算法(WSSA)。首先借助佳点集法对种群进行了初始化处理;其次借助鲸鱼算法中螺旋式搜索因子形成自适应权重迭代因子,提高算法全局搜索能力的同时保证局部的收敛性;随后在跟随者位置更新中加入柯西-高斯变异因子对原迭代进行扰动更新,提高算法的全局寻优能力;最后基于改进前后的算法进行了模型求解和适应度比较,验证了所提算法的有效性。

基于功能性电刺激的肘部运动迭代学习控制研究

功能性电刺激(functional electrical stimulation,FES)是治疗脑卒中后运动障碍的重要方法。考虑到现有动力学建模方法复杂、控制精度有待提高,该文提出了一种基于FES的肘部运动的带有遗忘因子的迭代学习控制方法。该研究利用Hammerstein结构建立肘部肌肉骨骼模型,在此基础上设计了带有遗忘因子的迭代学习控制的FES系统。通过计算样本实际输出与模型输出角度之间的均方根误差和最大角度误差,检验所建立的肌骨模型的可靠性。通过仿真分析和实际控制实验,评估了闭环FES系统的控制效果,并与传统的迭代学习控制FES系统进行了对比,说明了控制方法的有效性。研究结果表明,所建立的肘部肌骨模型适用于研究电刺激下肘关节的运动特性,并且带有遗忘因子的迭代学习控制方法在肘部控制中表现出更优越的性能。

PI-type Iterative Learning Control for Nonlinear Electro-hydraulic Servo Vibrating System

For the electro-hydraulic servo vibrating system（ESVS） with the characteristics of non-linearity and repeating motion, a novel method, PI-type iterative learning control（ILC）, is proposed on the basis of traditional PID control. By using memory ability of computer, the method keeps last time＇s tracking error of the system and then applies the error information to the next time＇s control process. At the same time, a forgetting factor and a D-type learning law of feedforward fuzzy-inferring referenced displacement error under the optimal objective are employed to enhance the systemic robustness and tracking accuracy. The results of simulation and test reveal that the algorithm has a trait of high repeating precision, and could restrain the influence of nonlinear factors like leaking, external disturbance, aerated oil, etc. Compared with traditional PID control, it could better meet the requirement of nonlinear electro -hydraulic servo vibrating system.

Improved gradient iterative algorithms for solving Lyapunov matrix equations

In this paper, an improved gradient iterative （GI） algorithm for solving the Lyapunov matrix equations is studied. Convergence of the improved method for any initial value is proved with some conditions. Compared with the GI algorithm, the improved algorithm reduces computational cost and storage. Finally, the algorithm is tested with GI several numerical examples.

Solution of stress intensity factors of multiple cracks in plane elasticity with eigen COD formulation of boundary integral equation

The concept of eigen crack opening displacement （COD） can be defined as the COD of a crack in infinite plate under the tractions acting on the crack surface. By introducing this concept, the eigen COD formulation of boundary integral equation is proposed in this paper, together with the solution procedures for multiple crack problems in plane elasticity. With the proposed approach, the multiple crack problems can be solved with the conventional displacement discontinuity boundary integral equations in an iterative fashion with a small size of system matrix as that in the numerical Green’s function （NGF） approach but without the trouble to determine the complementary solutions since the standard boundary element discretization on the crack surface is no longer required with the proposed approach. Some numerical examples computing the stress intensity factors are presented and compared with those in literature to show the accuracy and the effectiveness of the proposed approach.

Optimisation Method for Determination of Crack Tip Position Based on Gauss-Newton Iterative Technique

In the digital image correlation research of fatigue crack growth rate,the accuracy of the crack tip position determines the accuracy of the calculation of the stress intensity factor,thereby affecting the life prediction.This paper proposes a Gauss-Newton iteration method for solving the crack tip position.The conventional linear fitting method provides an iterative initial solution for this method,and the preconditioned conjugate gradient method is used to solve the ill-conditioned matrix.A noise-added artificial displacement field is used to verify the feasibility of the method,which shows that all parameters can be solved with satisfactory results.The actual stress intensity factor solution case shows that the stress intensity factor value obtained by the method in this paper is very close to the finite element result,and the relative error between the two is only−0.621%;The Williams coefficient obtained by this method can also better define the contour of the plastic zone at the crack tip,and the maximum relative error with the test plastic zone area is−11.29%.The relative error between the contour of the plastic zone defined by the conventional method and the area of the experimental plastic zone reached a maximum of 26.05%.The crack tip coordinates,stress intensity factors,and plastic zone contour changes in the loading and unloading phases are explored.The results show that the crack tip change during the loading process is faster than the change during the unloading process;the stress intensity factor during the unloading process under the same load condition is larger than that during the loading process;under the same load,the theoretical plastic zone during the unloading process is higher than that during the loading process.

基于高频信号注入的同步电机无传感器控制

针对现有低速同步电机无传感器控制精度低、运算复杂的问题,提出了一种适用于静止和低速应用场合的高频电压信号注入的同步电机无传感器驱动控制方法(椭圆拟合技术)。首先,建立了永磁同步电动机(PMSM)的数学模型,分析了椭圆拟合技术判断永磁同步电机转子位置的原理;其次,通过对比线性最小二乘法问题的3种求解方法,显示了QR分解法的优势,并提出了椭圆拟合技术中QR分解原理;最后,在两种不同的控制平台下进行了实验验证。结果表明所提出的椭圆拟合技术不受信号处理延迟效应的影响,响应速度快;只需调整遗忘因子一个参数,设置简单,适用于工业领域的广泛应用。

存在干扰模式时的微波谐振器Q值计算方法

谐振法测量介质介电常数时需要计算谐振器的无载Q值。当微波谐振器的工作模式受干扰模式影响时,会导致无载Q值的计算出现偏差。文章针对这种情况提出了一种存在干扰模式时计算微波谐振器无载Q值的迭代算法。该方法基于所提出的反向叠加和同相叠加两种等效电路模型,以传输系数模值平方之差在所有频点的平方之和作为目标函数,采用尺度变换最速下降法进行迭代。将圆柱形金属谐振腔的高Q值TE011模作为工作模式、简并的低Q值TM111模作为干扰模式,通过仿真和实测对该方法进行了验证。实测结果表明,当干扰模式较强时,3 dB法计算的工作模式Q值偏离真值14%,而所提出的迭代法的计算结果偏离真值不到1%。

基于LLC变换器的变权重DFC光伏MPPT算法

太阳能具有清洁、可持续等优势,被广泛应用于光伏发电,而最大功率点追踪(MPPT)是光伏发电的关键技术。针对基于LLC变换器脉冲频率调制(PFM)控制的中心点迭代MPPT法迭代次数过多,导致追踪速度较慢的问题,此处提出一种变权重直接频率控制(DFC)光伏MPPT算法,通过对比中心点迭代法和不同权值迭代法的光伏功率和开关频率曲线,在中心点迭代法的基础上增加了每次迭代的权重因子,根据划分的区域及对应点的dP/df,确定每次迭代的权重因子的值,实现快速MPPT控制。试验结果表明,所提变权重DFC法较传统中心点迭代法在进入最大功率点范围过程中迭代次数少,提高了追踪速度和稳态精度。

引入改进迭代局部搜索的灰狼算法及应用

针对标准灰狼算法(GWO)收敛速度慢,易陷入局部最优等缺点,提出一种引入改进迭代局部搜索的灰狼算法(IGWO)。首先,通过佳点集策略增强初始种群的均匀性与多样性;其次,采用双收敛因子,收敛因子基于种群位置非线性自适应更新,在种群寻优全期平衡全局勘探与局部开发能力;再次,在种群位置更新公式引入欧氏动态权重与莱维飞行策略,提升寻优精度,并帮助种群跳出局部最优值;最后,引入改进迭代局部搜索,使算法的搜索能力更加灵活,帮助算法加速收敛。通过10个基准测试函数的仿真分析及种群寻优平衡性对比,证明了IGWO具有更优的寻优精度、稳定性及收敛速度,随后将IGWO应用于工程优化问题中,相比GWO、GJO、WOA、HSSAHHO、SCHOA、NCPGWO、DSFGWO 7种算法,适应度分别优化了3.25%、27.2%、28.9%、3.15%、3.04%、0.23%、0.07%,证实了在工程应用中的可行性和有效性。

基于迭代加权最小二乘的桥梁动态称重理论与试验研究

目前商用桥梁动态称重系统(weigh-in-motion systems,BWIM)大多基于Moses算法,虽然能高效快速地识别行驶于桥梁的车辆轴重,但轴重识别精度偏低。为解决这一问题,提出基于迭代加权最小二乘的桥梁动态称重(iteratively reweighted least squares,IRLS)算法。与Moses算法不同,IRLS算法考虑了荷载响应中存在的多种不确定性因素,为每个荷载响应值提供一个合适的权重系数,区分不同荷载响应对轴重识别的贡献度。首先,将迭代加权最小二乘引入桥梁动态称重,推导出相应的轴重识别计算公式;然后,通过车桥数值仿真模型,分别用IRLS算法和Moses算法识别轴重,对比分析两种算法的精度及影响因素;最后,基于怀化舞水五桥引桥的车桥动力试验,进一步验证IRLS算法用于桥梁动态称重的有效性和准确性。结果表明,IRLS算法能较合理地分配不同荷载响应对轴重识别的贡献度,在一定程度上提高车辆轴重识别的精度。