线性不确定系统的鲁棒D型迭代学习控制

研究一类线性不确定系统的鲁棒D型迭代学习控制问题.首先针对一类线性标称控制对象,建立其迭代学习控制的二维模型;然后基于获得的二维模型,利用二维系统稳定性理论,获得系统在迭代初态与期望初态一致和不一致两种情形下的D型迭代学习控制律的存在条件和设计方法;进一步,将所得结果推广至控制对象包含不确定性的情形.所得结果以线性矩阵不等式(LMI)的形式给出,可以方便地利用Matlab中的LMI工具箱求解.最后,数值仿真实例验证了本文所提方法的有效性.     

非脆弱离散重复控制的二维模型方法

针对一类线性离散系统,提出一种基于二维模型的非脆弱离散重复控制设计方法.通过独立地考虑重复控制系统的控制与学习行为,建立离散重复控制系统的二维模型. 在此基础上,针对重复控制器和反馈控制器具有不确定性的离散重复控制系统,给出了基于线性矩阵不等式的系统稳定性条件和重复控制律. 最后,数值仿真实例验证了所提方法的有效性.     

Series solutions of coupled differential equations with one regular singular point

We consider two linear second-order ordinary differential equations. r=0 is a regular singular point of these equations. Applying the classical Method of Frobenius, we do not obtain any indicial equation and therefore no solution, because the differential equations are coupled.

In this paper, we present an extended Method of Frobenius on a coupled system of two ordinary differential equations. These equations come from the micropolar theory, which is one of the three kinds of the new 3M physics.     

On a class of finite linear spaces with few lines

A famous result of de Bruijn and Erdős (Indag. Math. 10 (1948) 421–423) states that a finite linear space has at least as many lines as points, with equality only if it is a projective plane or a near-pencil. This result led to the problem of characterizing finite linear spaces for which the difference between the number b of lines and the number v of points is assigned.

In this paper finite linear spaces with b−vm, m being the minimum number of lines on a point, are characterized.     

Monotonicity and positive invariance of linear systems over dioids

In this paper, we make connections between two apparently different concepts. The first concept is the (linear) monotonicity of a given matrix which is usually used in order to compare Markov chains. This concept is involved in the simplification of complex stochastic systems in order to control the approximation error made. The second concept is the positive invariance of sets by a (linear) map. The properties of positively invariant sets are involved in many different problems in classical control theory, such as constrained control, robustness analysis, optimisation, and also in aggregation of Markov chains (namely strong lumpability and coherency).

In the context of linear dynamical systems over semirings which play an important role in the study of discrete event systems, we establish links between monotone (or isotone) linear maps and linear maps which admit some special families of positively invariant sets.     

Path optimization for graph partitioning problems

This paper presents a new heuristic for graph partitioning called Path Optimization (PO), and the results of an extensive set of empirical comparisons of the new algorithm with two very well-known algorithms for partitioning: the Kernighan-Lin algorithm and simulated annealing. Our experiments are described in detail, and the results are presented in such a way as to reveal performance trends based on several variables. Sufficient trials are run to obtain 99% confidence intervals small enough to lead to a statistical ranking of the implementations for various circumstances. The results for geometric graphs, which have become a frequently used benchmark in the evaluation of partitioning algorithms, show that PO holds an advantage over the others.

In addition to the main test suite described above, comparisons of PO to more recent partitioning approaches are also given. We present the results of comparisons of PO with a parallelized implementation of Goemans' and Williamson's 0.878 approximation algorithm, a flow-based heuristic due to Lang and Rao, and the multilevel algorithm of Hendrickson and Leland.     

An efficient algorithm for regularization of Laplace transform inversion in real case

We address design of a numerical algorithm for solving the linear system arising in numerical inversion of Laplace transforms in real case [L. D’Amore, A. Murli, Regularization of a Fourier series method for the Laplace transform inversion with real data, Inverse Problems 18 (2002) 1185–1205]. The matrix has a condition number that grows almost exponentially and the singular values decay gradually towards zero. In such a case, because of this intrinsic strong instability, the main difficulty of any numerical computation is the ability of discovering at run time, only using data, what is the maximum attainable accuracy on the solution.

In this paper, we use GMRES with the aim of relating the current residuals to the maximum attainable accuracy of the approximate solution by using a suitable stopping rule. We prove that GMRES stops after, at most, as many iterations as the number of the largest eigenvalues (compared to the machine epsilon). We use a split preconditioner that symmetrically precondition the initial system. By this way, the largest eigenvalue dynamically provides the estimate of the condition number of the matrix.     

Converting suffix trees into factor/suffix oracles

Several methods to compress suffix trees were defined, most of them with the aim of obtaining compact (that is, space economical) index structures. Besides this practical aspect, a compression method can reveal structural properties of the resulting data structure, allowing a better understanding of it and a better estimation of its performances.

In this paper, we propose a simple method to compress suffix trees by merging couples of nodes. This idea was already used in the literature in a context different from ours. The originality of our approach is that the nodes we merge are not chosen with respect to their subtrees (which is difficult to test algorithmically), nor with respect to the words spelled along branches (which usually requires testing several branches before finding the good one) but with respect to their position in the tree (which is easy to compute). Another particularity of our method is it needs to read no edge label: it is exclusively based on the topology of the suffix tree. The compact structure resulting after compression is the factor/suffix oracle introduced by Allauzen, Crochemore and Raffinot whose accepted language includes the accepted language of the corresponding suffix tree.

The interest of our paper is therefore threefold:

1. A topology-based compression method is defined for (compact) suffix trees.

2. A new property of a factor/suffix oracle is established, that is, like a DAG, it results from the corresponding suffix tree after a linear number of appropriate node mergings; unlike a DAG, the merged nodes do not necessarily have isomorphical subtrees.

3. A new algorithm to transform a suffix tree into a factor/suffix oracle is given, which has linear running time and thus improves the quadratic complexity previously known for the same task.

High-Order \mathcal{D}^{\alpha}-Type Iterative Learning Control for Fractional-Order Nonlinear Time-Delay Systems

This paper presents a high-order $\mathcal{D}^{\alpha}$ -type iterative learning control (ILC) scheme for a class of fractional-order nonlinear time-delay systems. First, a discrete system for $\mathcal{D}^{\alpha}$ -type ILC is established by analyzing the control and learning processes, and the ILC design problem is then converted to a stabilization problem for this discrete system. Next, by introducing a suitable norm and using a generalized Gronwall–Bellman Lemma, the sufficiency condition for the robust convergence with respect to the bounded external disturbance of the control input and the tracking errors is obtained. Finally, the validity of the method is verified by a numerical example.     

Iterative learning control for linear discrete delay systems via discrete matrix delayed exponential function approach

ABSTRACT

This paper proposes iterative learning control (ILC) for linear discrete delay systems with randomly varying trial lengths without knowing prior information on the probability distribution of random iteration length. Based on matrix delayed exponential function approach, an explicit solution to the linear discrete delay controlled systems is used to generate a sequence of outputs that approximate the desired reference by adopting two ILC update laws in the presence of randomly iteration-varying lengths. A new and direct mathematical technique is explored to deal with ILC for linear discrete delay systems. Two illustrative examples are provided to verify the theoretical results.     

Crank–Nicolson least-squares Galerkin procedures for parabolic integro-differential equations

Two Crank–Nicolson least-squares Galerkin finite element schemes are formulated to solve parabolic integro-differential equations. The advantage of this method is that it is not subject to the LBB condition. The convergence analysis shows that the methods yield the approximate solutions with optimal accuracy in H(div; Ω) × H¹(Ω) and (L²(Ω))² × L²(Ω), respectively. Moreover, the two methods both get the approximate solutions with second-order accuracy in time increment.     

基于输出反馈的一类时滞系统鲁棒H∞容错控制

针对状态具有多个时滞的线性不确定性系统,基于李雅普诺夫稳定性理论,矩阵不等式及线性矩阵不等式方法,设计带有多个时滞记忆的输出反馈鲁棒H∞容错控制器.研究了在执行器发生故障的情况下,多时滞不确定性系统的鲁棒H∞容错控制的问题.首先给出了多个时滞记忆的输出反馈鲁棒H∞容错控制器的综合分析,进一步给出参数不确定项的多时滞系统的渐近稳定的充分条件,以及满足给定性能指标鲁棒H∞容错控制器的设计方法.仿真结果证明了该方法的有效性和可行性.     

Analytic modelling of solar radiation: driven temperature variations of outdoor surfaces

An analytic model is described for the variation of surface temperature T₀(t) ofa freely evaporating or totally dry surface exposed to complicated, non-analytic variations of meteorological conditions expressed in (N + 1)-point time series form. Its basis is a parameterized, analytic representation of T₀, inserted in linearized equations describing the surface energy balance and the concurrent underlying heat conduction. Applied to diurnal variations (with N = 24) over bare soil, the model reproduces observed temperatures with a typical standard deviation less than 1K, and the daily mean within 0.1 K.

The method should find general application in modelling of storage systems subject to complicated, discretely-sampled boundary conditions, where a linear analytic equation links the latter to the storage term.     

On the Glivenko–Cantelli theorem for generalized empirical processes based on strong mixing sequences

Given \s{X_i, i 1\s} as non-stationary strong mixing (n.s.s.m.) sequence of random variables (r.v.'s) let, for 1 i n and some γ ε [0, 1],

F₁(x)=γP(X_i<x)+(1-γ)P(X_ix)

and

I_i(x)=γI(X_i<x)+(1-γ)I(X_ix)

. For any real sequence \s{C_i\s} satisfying certain conditions, let

.

In this paper an exponential type of bound for P(D_n ), for any >0, and a rate for the almost sure convergence of D_n are obtained under strong mixing. These results generalize those of Singh (1975) for the independent and non-identically distributed sequence of r.v.'s to the case of strong mixing.     

A generalized Desargues configuration and the pure braid group

In this paper, a configuration with n = (₂^d) points in the plane is described. This configuration, as a matroid, is a Desargues configuration if d = 5, and the union of (₅^d) such configurations if d> 5. As an oriented matroid, it is a rank 3 truncation of the directed complete graph on d vertices. From this fact, it follows from a version of the Lefschetz-Zariski theorem implied by results of Salvetti that the fundamental group π of the complexification of its line arrangement is Artin's pure (or coloured) braid group on d strands.

In this paper we obtain, by using techniques introduced by Salvetti, a new algorithm for finding a presentation of π based on this particular configuration.     

Two linear transformations each tridiagonal with respect to an eigenbasis of the other

Let denote a field, and let V denote a vector space over with finite positive dimension. We consider a pair of linear transformations A:V→V and A^*:V→V satisfying both conditions below:

1. [(i)] There exists a basis for V with respect to which the matrix representing A is diagonal and the matrix representing A^* is irreducible tridiagonal.

2. [(ii)] There exists a basis for V with respect to which the matrix representing A^* is diagonal and the matrix representing A is irreducible tridiagonal.

We call such a pair a Leonard pair on V. Refining this notion a bit, we introduce the concept of a Leonard system. We give a complete classification of Leonard systems. Integral to our proof is the following result. We show that for any Leonard pair A,A^* on V, there exists a sequence of scalars β,γ,γ^*,,^* taken from such that both

where [r,s] means rs−sr. The sequence is uniquely determined by the Leonard pair if the dimension of V is at least 4. We conclude by showing how Leonard systems correspond to q-Racah and related polynomials from the Askey scheme.     

Iterative learning consensus control with initial state learning for fractional order distributed parameter models multi-agent systems

This paper considers the consensus control problem of multi-agent systems (MAS) with distributed parameter models. Based on the framework of network topologies, a second-order PI-type iterative learning control (ILC) protocol with initial state learning is proposed by using the nearest neighbor knowledge. A discrete system for proposed ILC is established, and the consensus control problem is then converted to a stability problem for such a discrete system. Furthermore, by using generalized Gronwall inequality, a sufficient condition for the convergence of the consensus errors between any two agents is obtained. Finally, the validity of the proposed method is verified by two numerical examples.     

Linear fuzzy regression

This paper presents an approach which is useful for regression analysis in the case of heterogeneity of a set of observations, for which regression is evaluated. The proposed procedure consists of two stages. First, for a set of observations, fuzzy classification is determined. Due to this, homogenous classes of observations which are of hyperellipsoidal shape, are obtained. Then for each fuzzy class, the so called linear fuzzy regression is evaluated.

In the paper the method of calculating linear fuzzy regression coefficients is given. It is a generalized version of the least squares method. The formula for the values of coefficients is given. Some properties of linear fuzzy regression are analyzed. It is proved that in one- and two-dimensional cases, the formulae are analogous to those for usual regression. A measure of goodness-of-fit and the method of determination of the number of fuzzy classes are also given.

Presented examples indicate the superiority of fuzzy regression in comparison to usual regression in the case of heterogenous observations.     

On the Odir iterative method for non‐symmetric indefinite linear systems

Several Krylov subspace iterative methods have been proposed for the approximation of the solution of general non‐symmetric linear systems. Odir is such a method. Here we study the restarted version of Odir for non‐symmetric indefinite linear systems and we prove convergence under certain conditions on the matrix of coefficients. These results hold for all the restarted Krylov methods equivalent to Odir. We also introduce a new truncated Odir method which is proved to converge for a large class of non‐symmetric indefinite linear systems. This new method requires one‐half of the storage of the standard Odir. Copyright © 2001 John Wiley & Sons, Ltd.     

非线性随机分数阶延迟积分微分方程Euler-Maruyama方法的强收敛性

本文研究了一类新的模型问题:非线性随机分数阶延迟积分微分方程.当方程中的漂移项和扩散项满足全局Lipschitz条件和线性增长条件时,基于压缩映射原理给出了该方程解存在唯一的充分条件.由于理论求解的困难,构造了一种数值方法(Euler-Maruyama方法),并证得强收敛阶为α-1/2,α∈(1/2,1].最后通过数值试验,验证了这一理论结果.