线性多变量系统传递函数阵零点定义的等价性

本文,给出了用两种不同方式定义传递函数阵零点的等价性。近年来,很多人从不同的角度,用不同的方法,讨论了线性多变量系统传递函数阵的零点及其性质,虽众说纷云,总起来说可分为两类:一种是利用有理分式阵的“分子”的Smith型;另一种是利用有理分式阵的最小阶(右)逆的极点。本文指出这两种定义是完全等价的。     

相对完备性与抽象数据类型的描述

完备性问题是抽象数据类型理论中的一个基本问题。本文提出了相对完备与基始完备的概念;讨论了描述的基始完备与模型的行为等价、描述的相对完备与模型的计算等价之间的一致性;证明了基始完备的描述可唯一地扩充成为相对完备,原描述的“终结模型”恰好就是其极大扩充的“初始模型”,从而揭示了“初始代数语义”与“终结代数语义”这两种不同方法之间的内在联系。     

微分方程模糊初值问题的解

研究了一阶线性微分方程模糊初值问题,利用模糊微分方程的刻画方程和初值之间的关系,给出了一阶线性微分方程模糊初值问题的一种求解方法,讨论了同基于Hukuhara微分求解方法之间的关系,证明了在一定条件下两种方法是等价的,文中的实例说明了这一点.     

求解非定常对流扩散方程的流函数松弛方法

提出了一种求解线性和非线性对流扩散方程的流函数松弛方法.方法的主要思想是利用流函数松弛近似将原始的方程转化成等价的松弛方程组,新的松弛方程组是带源项的双曲系统.通过稳定性分析可以知道新系统的耗散系数可由松弛系数调整.数值实现亦证明这个方法可以快速有效地描述对流扩散方程的解.     

辛映射与Hamilton控制系统

给定等价辛流形 ,即辛同态或形变等价的辛流形 ,研究了建立在这些辛流形上的Hamilton控制系统之间的一些性质的联系 ,诸如 (局部 )能观测性 ,强可接近性 ,(拟 )极小性等 .而且 ,利用Cort啨ｓ介绍的 (弱 )外等价系统的概念 ,给出使得两个Hamilton控制系统是辛同态的一个充分条件     

线性坐标变换下非线性系统转换为三角形式系统

对一类非线性控制系统可以先通过等价转换为三角形式非线性系统,然后通过后推法和前推法设计控制器.故而考察在线性坐标变换和状态反馈之下,给定仿射非线性系统是否等价于严格上三角形式,下三角形式系统和上对角系统.利用微分几何控制理论,给出非线性系统等价于上述三种特定系统的充分必要条件.最后,用一个实例说明如何通过状态反馈和线性坐标变换实现上述等价转换.     

一类广义区间值模糊粗糙集的公理化刻画

首先在一般区间值模糊关系上定义了两个论域上的一类广义区间值模糊粗糙集.借助区间值模糊集的截集给出区间值模糊粗糙上、下近似算子的一般表示.讨论了各种特殊的区间值模糊关系与区间值模糊近似算子性质之间的等价刻画.最后利用公理化方法刻画区间值模糊粗糙集.描述区间值模糊上、下近似算子的公理集保证了生成相同近似算子的区间值模糊关系的存在性.     

二值命题逻辑中的极大命题集与完备命题集

系统讨论了二值命题逻辑系统中极大命题集与完备命题集,给出了两种命题集的等价描述和表示定理,揭示了极大命题集和完备命题集的深刻内涵和联系.     

基于矩阵方法的Myerson值的一种规范化

在合作对策中,将一个值规范化意味着让其满足有效性.Hamiache利用矩阵方法得到了带图结构效用可转移合作对策Myerson值的一种规范化.通过给出一种新的满足最小划分唯一性的集合簇,本文利用矩阵方法得到了Myerson值的另一种规范化.特殊地,当所考虑的图结构在各连通分支上的限制均为完全图时,文中给出了带联盟结构效用可转移合作对策AumannDrèze值的一种规范化.与其它Myerson值规范化的比较分析表明本文规范化与van den Brink等的等价.由此van den Brink等的规范化与Hamiache的规范化都可用矩阵方法来描述,而它们之间的区别则被归结于满足最小划分唯一性的集合簇之不同.     

广义系统平衡点的归纳分析

本文利用投影矩阵．将广义系统平衡点问题等价地归结为一个子流形上的正常系统平衡点结构问题，为对广义系统进行定性分析提供了一种新的方法．     

Localization of eigenvalues of polynomial matrices

We consider the problem of localization of eigenvalues of polynomial matrices. We propose sufficient conditions for the spectrum of a regular matrix polynomial to belong to a broad class of domains bounded by algebraic curves. These conditions generalize the known method for the localization of the spectrum of polynomial matrices based on the solution of linear matrix inequalities. We also develop a method for the localization of eigenvalues of a parametric family of matrix polynomials in the form of a system of linear matrix inequalities.     

多项式矩阵代数性质讨论

本文利用系统与控制论中有关多项式矩阵的结果,对多项式矩阵代数性质进行讨论,得到的主要结果有多项式方阵环是主理想环,也是主单侧理想环。     

Eigenvectors of interval matrices over max–plus algebra

The behaviour of a discrete-event dynamic system is often conveniently described using a matrix algebra with operations max and plus. Such a system moves forward in regular steps of length equal to the eigenvalue of the system matrix, if it is set to operate at time instants corresponding to one of its eigenvectors. However, due to imprecise measurements, it is often unappropriate to use exact matrices. One possibility to model imprecision is to use interval matrices. We show that the problem to decide whether a given vector is an eigenvector of one of the matrices in the given matrix interval is polynomial, while the complexity of the existence problem of a universal eigenvector remains open. As an aside, we propose a combinatorial method for solving two-sided systems of linear equations over the max–plus algebra.     

Divisibility and one-sided equivalence of polynomial matrices

A criterion is established for the one-sided equivalence of polynomial matrices; over an arbitrary field. If B(x) is a polynomial matrix of maximal rank, then a condition for the divisibility of a polynomial matrix A(x) by B(x) without a remainder, is indicated. For a square polynomial matrix, necessary and sufficient conditions for the one-sided equivalence of it to a unitary polynomial matrix are presented, and also a method is proposed for its construction.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 9, pp. 1213–1219, September, 1990.     

Polynomial numerical hulls of matrix polynomials,II

In this article, we study some algebraic and geometrical properties of polynomial numerical hulls of matrix polynomials and joint polynomial numerical hulls of a finite family of matrices (possibly the coefficients of a matrix polynomial). Also, we study polynomial numerical hulls of basic A-factor block circulant matrices. These are block companion matrices of particular simple monic matrix polynomials. By studying the polynomial numerical hulls of the Kronecker product of two matrices, we characterize the polynomial numerical hulls of unitary basic A-factor block circulant matrices.     

Spectral factorization of non-symmetric polynomial matrices

The topic of the paper is spectral factorization of rectangular and possibly non-full-rank polynomial matrices. To each polynomial matrix we associate a matrix pencil by direct assignment of the coefficients. The associated matrix pencil has its finite generalized eigenvalues equal to the zeros of the polynomial matrix. The matrix dimensions of the pencil we obtain by solving an integer linear programming (ILP) minimization problem. Then by extracting a deflating subspace of the pencil we come to the required spectral factorization. We apply the algorithm to most general-case of inner–outer factorization, regardless continuous or discrete time case, and to finding the greatest common divisor of polynomial matrices.