非正则线性系统的闭环P型迭代学习控制

迭代学习控制是改善具有重复运行性质过程的跟踪性能的有效方法。开环迭代学习控制学习周期长，在迭代学习的初期容易出现不稳定和高增益的现象。对非正则系统的迭代学习控制，需要采用高阶微分学习律。该文针对一类非正则线性定常连续系统，讨论了闭环P型迭代学习控制律，给出并证明了闭环P型迭代学习控制律的收敛性条件的两个定理，解决了非正则系统的P型迭代学习控制问题。仿真实例说明闭环迭代学习律的有效性和快速性。     

几何迭代法及其应用综述

几何迭代法,又称渐进迭代逼近(progressive-iterative approximation,PIA),是一种具有明显几何意义的迭代方法.它通过不断调整曲线曲面的控制顶点,生成的极限曲线曲面插值(逼近)给定的数据点集.文中从理论和应用2个方面对几何迭代法进行了综述.在理论方面,介绍了插值型几何迭代法的迭代格式、收敛性证明、局部性质、加速方法,以及逼近型几何迭代法的迭代格式和收敛性证明等.进而,展示了几何迭代法在几个方面的成功应用,包括自适应数据拟合、大规模数据拟合、对称曲面拟合,以及插值给定位置、切矢量和曲率矢量的曲线迭代生成,有质量保证的四边网格和六面体网格生成,三变量B-spline体的生成等.     

Systolic Preconditioned Algorithms for the Iterative Solution of Linear Systems

Systolic algorithms for preconditioned iterative procedures are described and discussed in relation to existing systolic arrays for iterative methods applied to the systems of linear equations arising from the solution of partial differential equations. In boundary value problems it is shown that if the cost of the preconditioned systolic arrays in terms of hardware is related to the (standard) iterative methods, then savings in the number of array cells can be made when the system involved is large and sparse (narrow bandwidth) with a significant improvement in convergence rate.     

分形图像插值加速收敛方法的改进

图像插值是对数字图像进行不同比例放大过程中必须解决的关键问题。由于分形具有无穷的 细节,采用分形的方法对图像进行插值可以使图像放大后保持较高的视觉分辨率。针对分形图像插 值速度较慢的特点,提出了两种加速收敛的方法,即根据控制学中的有关理论,提出了一种简单易 行的带比较环节的迭代方法,提高迭代收敛速度;此外,尝试一种交叉迭代法,同样达到了加速收敛 的目的。最后,对两种加速方法的实验结果所反映的特点和不足进行了分析和讨论。     

一类线性离散切换系统的迭代学习控制

考虑具有任意切换序列线性离散切换系统的迭代学习控制问题. 假设切换系统在有限时间区间内重复运行, P型ILC算法可实现该类系统在整个时间区间内的完全跟踪控制. 采用超向量方法给出了算法在迭代域内收敛的条件, 并在理论上分析了的收敛性. 仿真示例验证了理论的结果.     

Closed-loop P-type Iterative Learning Control of Uncertain Linear Distributed Parameter Systems

An iterative learning control problem for a class of uncertain linear parabolic distributed parameter systems is discussed, which covers many processes such as heat and mass transfer, convection diffusion and transport. Under condition of allowing system state initially to have error in the iterative process a closed-loop P-type iterative learning algorithm is presented, and the sufficient condition of tracking error convergence in L2 norm is given. Next, the convergence of the tracking error in L2 and W1,2 space is proved by using Gronwall-Bellman inequality and Sobolev inequality. In the end, a numerical example is given to illustrate the effectiveness of the proposed method.      

线性广义系统的迭代学习控制

针对线性时不变广义系统的迭代学习控制问题．利用时间加权范数性质．通过Frobenius范数给出广义系统在D型和PD型闭环学习律作用下系统的实际输出轨迹逐渐逼近理想输出轨迹的充分条件．并指出在D型闭环学习律的基础上加上P型闭环学习律不影响控制系统的收敛性．但可以改变系统的性能．仿真算例说明了该方法的有效性．     

Turbo码译码的收敛性与停止迭代判据

为减少译码延时,根据Turbo码的似然比的可靠性讨论了Turbo的收敛性,提出了两种基于可靠性的迭代停止判决,通过仿真译码时的平均迭代次数明显减少,并且所获得的性能几乎没有下降,表明提出的迭代停止判据有效。     

Turbo-CPM系统迭代检测收敛性的研究

根据连续相位调制(CPM)的分解模型,CPM调制可以分解为连续相位编码(CPE)和无记忆调制(MM),基于CPE的记忆和递归特性,结合外部的Turbo码及交织器,建它了Turbo-CPM系统模型.针对短帧系统在迭代检测过程中存在的正反馈现象,设计了一种基于加权外信息交换的迭代检测接收机.理论分析与仿真结果表明:在低信噪比条件下,所设计的接收机不仅能够有效地抑制系统中存在的正反馈现象,改善系统的收敛性,提高系统的误比特率性能,而且减少了平均迭代次数,提高了系统的实时性.     

Solution of Systems of Linear Equations by the p-Adic Method

A new algorithm for solving systems of linear equations Ax = b in an Euclidean domain is suggested. In the case of the ring of integers, the complexity of this algorithm is O (n ³ mlog² ||A||), where n)$$ " align="middle" border="0"> is a matrix of rank n and , if standard algorithms for the multiplication of integers and matrices are used. Under the same conditions, the best algorithm of this kind among those published earlier, which was suggested by Labahn and Storjohann in [1], has complexity O (n ⁴ mlog² ||A||). True, when using fast algorithms for the multiplication of numbers and matrices, the theoretical complexity estimate for the latter algorithm is O (n mlog² ||A||), which is better than the similar estimate O (n ³ mlog||A||) for the new algorithm.     

一种新型的迭代学习控制器设计研究

针对一般连续系统的迭代学习控制问题进行了讨论,通过对常用的P型迭代学习控制算法的分析,在分析比较P型、PD型迭代学习控制律存在问题的基础上,提出了一种新型的迭代学习控制算法,利用误差信号以及相邻两次误差的差值信号对系统控制律进行逐次修正,既能避免PD型迭代算法由于微分作用而出现的不良影响,又可以充分地利用了系统已保存的有效信息,从而实现良好的跟踪效果以及较快的跟踪收敛速度,最后通过对一非线性连续系统的仿真,结果验证了算法相对于传统P算法的有效性与优越性.     

Study on the Application of Iterative Learning Control to Terminal Control of Linear Time-varying Systems

An iterative learning control algorithm based on shifted Legendre orthogonal polynomials is proposed to address the terminal control problem of linear time-varying systems. First, the method parameterizes a linear time-varying system by using shifted Legendre polynomials approximation. Then, an approximated model for the linear time-varying system is deduced by employing the orthogonality relations and boundary values of shifted Legendre polynomials. Based on the model, the shifted Legendre polynomials coefficients of control function are iteratively adjusted by an optimal iterative learning law derived. The algorithm presented can avoid solving the state transfer matrix of linear time-varying systems. Simulation results illustrate the effectiveness of the proposed method.     

迭代学习控制在线性时变系统终端控制问题中的应用研究

An iterative learning control algorithm based on shifted Legendre orthogonal polynomials is proposed to address the terminal control problem of linear time-varying systems. First, the method parameterizes a linear time-varying system by using shifted Legendre polynomials approximation. Then, an approximated model for the linear time-varying system is deduced by employing the orthogonality relations and boundary values of shifted Legendre polynomials. Based on the model, the shifted Legendre polynomials coefficients of control function are iteratively adjusted by an optimal iterative learning law derived. The algorithm presented can avoid solving the state transfer matrix of linear time-varying systems. Simulation results illustrate the effectiveness of the proposed method.     

Iterative learning control design for Smith predictor

The Smith predictor has been used to improve the closed-loop performance for systems with time delays. This paper proposes a frequency-domain method to design an iterative learning control to further improve the performance of Smith predictor controller. For a time-invariant plant with multiplicative perturbations and a Smith predictor controller, we derive a sufficient and necessary condition (which has the same form as that of a general robust performance design problem) for the iterative process to converge for all admissible plant uncertainties. In addition, the iterative learning controller under plant uncertainty is designed. An illustrative example demonstrating the main result is presented.     

方程迭代求根加速收敛的算法研究

本文介绍了方程迭代求根的方法．以迭代法的收敛性和收敛速度为出发点，提出并讨论了采用迭代值的组合和方程式的变换等技巧来提高迭代的收敛性并加快其收敛速度的算法．文中对算法进行了描述，并用具体实例证明了该算法的有效性．     

Formal Solution to Systems of Interval Linear or Non-Linear Equations

This is the first of two papers which present the Modal Interval Analysis as a framework where the search and interpretation of formal solutions for a set of simultaneous interval linear or non-linear equations is started on, together with the interval estimations for sets of solutions of real-valued systems in which coefficients and right-hand sides belong to certain intervals. The main purpose of this first paper is to show that the modal intervals are a suitable tool to approach problems where logical reference appear. Thus, it is possible to give a logical meaning to general solutions of the system of equations, obtained, in the linear case, by means of an algorithm whose convergence conditions are studied.     

加速抑制随机初态误差影响的迭代学习控制

针对一类具有不确定性的多输入多输出非线性系统,提出一种迭代学习控制算法.该算法具有的特点是：针对任意初态情形,结合开环 D型迭代学习控制器的优点,在时间轴上设计了一个随迭代次数增加而缩短的时间段.在该时间段上,控制算法对状态偏差进行修正,以使系统输出在此段时间后跟踪期望输出,且系统跟踪误差收敛到一个界内.这个界仅由系统自身不确定性和不确定的外界干扰决定,与初态误差无关.当外界扰动为0,以及迭代次数趋于无穷时,经过上述时间段后,系统输出精确跟踪期望输出.理论证明和仿真结果都说明了该算法的有效性.