ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.     

New results about semi-positive matrices

Our purpose is to present a number of new facts about the structure of semipositive matrices, involving patterns, spectra and Jordon form, sums and products, and matrix equivalence, etc. Techniques used to obtain the results may be of independent interest. Examples include: any matrix with at least two columns is a sum, and any matrix with at least two rows, a product, of semipositive matrices. Any spectrum of a real matrix with at least 2 elements is the spectrum of a square semipositive matrix, and any real matrix, except for a negative scalar matrix, is similar to a semipositive matrix. M-matrices are generalized to the non-square case and sign patterns that require semipositivity are characterized.     

The Effects of Poisson Contraction on Matrix Cracking in Brittle-Matrix Composites

The effects of Poisson contraction on matrix cracking in unidirectional fiber-reinforced brittle-matrix composites are studied in this paper. The fibers, initially held in the matrix by a compressive pressure due to the thermal expansion mismatch, are subjected to frictional slipping over the matrix as soon as a fiber-bridged crack is formed. The friction between the fibers and the matrix is assumed to follow the Coulomb friction law. A shear-lag model, which includes the Poisson contraction and the friction due to the relative fiber/matrix slipping, is adopted to calculate the stress and strain fields in the fibers and matrix. Using the energy balance approach, a relation for the critical matrix cracking stress for propagating of a semi-infinite fiber-bridged crack is derived. The results obtained show that the Poisson contraction has a strong effect on the predicted matrix cracking stress in brittle-matrix composites, especially in composites with a stiff matrix.     

The Bezoutian and the eigenvalue-separation problem for matrix polynomials

A generalized Bezout matrix for a pair of matrix polynomials is studied and, in particular, the structure of its kernel is described and the relations to the greatest common divisor of the given matrix polynomials are presented. The classical root-separation problems of Hermite, Routh-Hurwitz and Schur-Cohn are solved for matrix polynomials in terms of this Bezout matrix. The eigenvalue-separation results are also expressed in terms of Hankel matrices whose entries are Markov parameters of rational matrix function. Some applications of Jacobi's method to these problems are pointed out.     

Hermite-广义反Hamilton矩阵的一类反问题

给定矩阵X和B,利用矩阵的广义奇异值分解,得到了矩阵方程X~HAX=B有Hermite-广义反Hamiton解的充分必要条件及有解时解的—般表达式.用S_E表示此矩阵方程的解集合,证明了S_E中存在唯一的矩阵(?),使得(?)与给定矩阵A的差的Frobenius范数最小,并且给出了矩阵(?)的表达式;同时也证明了S_E中存在唯一的矩阵A_o,使得A_o是此矩阵方程的极小Frobenius范数Hermite-广义反Hamilton解,并且给出了矩阵A_o的表达式.     

ON HERMITE MATRIX POLYNOMIALS AND HERMITE MATRIX FUNCTIONS

In this paper properties of Hermite matrix polynomials and Hermite matrix functions are studied. The concept ot total set with respect to a matrix functional is introduced and the total property of the Hermite matrix polynomials is proved. Asymptotic behaviour of Hermite matrix polynomials is studied and the relationship of Hermite matrix functions with certain matrix differential equations is developed. A new expression of the matrix exponential for a wide class of matrices in terms of Hermite matrix polynomials is proposed.     

0-1对策的完全混合Nash均衡的代数求解法

将求解一般0-1策略对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程组的问题.作为一种特殊而重要的情形,利用Pascal矩阵,Newton矩阵(对角元素为Newton二项式系数的对角矩阵)和Pascal-Newton矩阵(Pascal矩阵和Newton矩阵的逆阵的乘积)将求解对称0-1对策的完全混合Nash均衡的问题转化为求解根为正的纯小数的高次代数方程的问题,并给出第二问题的反问题(由完全混合Nash均衡求解对称0-1对策族)的求解方法.同时,给出了一些算例来说明对应问题的算法.     

互反判断矩阵一致性指标研究

首先给出了互反判断矩阵与一致性互反判断矩阵集之间距离的定义,基于此定义,提出了一个新的互反判断矩阵一致性指标,并给出了此一致性指标的度量方法。对于不满足此一致性指标的互反判断矩阵,提出了一个迭代算法来提高其一致性程度。得出了群体互反判断矩阵一致性指标的下界,为提出的一致性指标应用于群决策问题提供了理论基础。最后用数值例子说明了该迭代算法的可行性和有效性以及群决策中的相关结论。     

基于乘性一致性残缺互补判断矩阵的决策方法

对于满足乘性一致性的残缺互补判断矩阵的决策问题,提出了一种决策方法。首先把互补判断矩阵的乘性一致性定义进行了简化,得到了互补判断矩阵乘性一致性的另外几种表达形式;进一步得到了在已知n-1个特殊元素的条件下,残缺互补判断矩阵中缺失元素的补全方法;然后给出了残缺互补判断矩阵可接受的条件,以及矩阵的一致性检验及调整方法;基于残缺互补判断矩阵,给出了以下决策步骤:残缺互补判断矩阵的一致性检验及调整过程,补全缺失元素的迭代过程和最优方案择优过程。最后给出了一个实例,通过该实例的计算以及本文方法与已有方法的比较,证明了本文方法是简便和有效的。     

Ergodic reduction of random products of two-by-two matrices

We consider a random product of two-by-two matrices of determinant one over an abstract dynamical system. When the two Lyapunov exponents are distinct, Oseledets’ theorem asserts that the matrix cocycle is cohomologous to a diagonal matrix cocycle. When they are equal, we show that the cocycle is conjugate to one of three cases: a rotation matrix cocycle, an upper triangular matrix cocycle, or a diagonal matrix cocycle modulo a rotation by π/2.     

On the best approximation matrix problem and matrix Fourier series

In this paper the concept of positive definite bilinear matrix moment functional, acting on the space of all the matrix valued continuous functions defined on a bounded interval [a,b] is introduced. The best approximation matrix problem with respect to such a functional is solved in terms of matrix Fourier series. Basic properties of matrix Fourier series such as the Riemann—Lebesgue, matrix property and the bessel—parseval matrix inequality are proved. The concept of total set with respect to a positive definite matrix functional is introduced, and the totallity of an orthonormal sequence of matrix polynomials with respect to the functional is established.     

Riccati equations and Lie series

Lie series and a special matrix notation for first-order differential operators are used to show that the Lie group properties of matrix Riccati equations arise in a natural way. The Lie series notation makes it evident that the solutions of a matrix Riccati equation are curves in a group of nonlinear transformations that is a generalization of the linear fractional transformations familiar from the classical complex analysis. It is easy to obtain a linear representation of the Lie algebra of the nonlinear group of transformations and then this linearization leads directly to the standard linearization of the matrix Riccati equations. We note that the matrix Riccati equations considered here are of the general rectangular type.     

L-structured matrices and linear matrix equations

Conditions for the existence of solutions, and the general solution of linear matrix equations are given, when it is known a priori that the solution matrix has a given structure (e.g. symmetric, triangular, diagonal). This theory is subsequently extended to matrix equations that are linear in several unknown 'structured' matrices, and to partitioned matrix equations.     

不同直觉偏好信息下的多属性决策方法

研究了属性值为实数且决策者对属性的偏好信息以直觉判断矩阵或残缺直觉判断矩阵给出的模糊多属性决策问题.首先介绍了直觉判断矩阵、一致性直觉判断矩阵、残缺直觉判断矩阵、一致性残缺直觉判断矩阵等概念,而后分别考虑关于直觉判断矩阵和残缺直觉判断矩阵的多属性决策问题,接着建立了基于直觉判断矩阵和残缺直觉判断矩阵的多属性群决策模型,通过求解这些模型获得属性的权重.进而给出了不同直觉偏好信息下的多属性决策方法.最后通过一个例子说明了该方法的可行性和实用性.     

Circularity of numerical ranges and block-shift matrices

Let A be a square complex matrix. Several characterizations are found for A to be permutationally similar to a block-shift matrix. One interesting equivalent condition is that the numerical range of every matrix with the same zero pattern as A is a circular disk. Equivalent conditions for the characteristic polynomial of the hermitian part of the matrix e^iθA to be the same for all real values θ are also obtained.Complex matrices of order four that are unitarily similar to a block-shift matrix are identified. A result of Marcus and Pesce [6] is extended, and an open question of Li and Tsing [4] is also answered partially.     

Pascal矩阵与Vandermonde矩阵的关系

EI-Mikkawy M证明了对称Pascal矩阵Q_n和Vlandermonde矩阵V_n之间满足矩阵方程Q_n=T_nV_n,这里T_n是一个随机矩阵。本文证明了随机矩阵T_n能够分解成第一类Stirling矩阵和对角矩阵的乘积,得到了矩阵T_n的元素之间的递推关系,从而回答了EI-Mikkawy M的一个公开问题。同时得到了一些与Stirling数相关的组合恒等式。     

A new operational matrix based on Bernoulli wavelets for solving fractional delay differential equations

In this research, a Bernoulli wavelet operational matrix of fractional integration is presented. Bernoulli wavelets and their properties are employed for deriving a general procedure for forming this matrix. The application of the proposed operational matrix for solving the fractional delay differential equations is explained. Also, upper bound for the error of operational matrix of the fractional integration is given. This operational matrix is utilized to transform the problem to a set of algebraic equations with unknown Bernoulli wavelet coefficients. Several numerical examples are solved to demonstrate the validity and applicability of the presented technique.     

Estimation of missing judgments in AHP pairwise matrices using a neural network-based model

Selecting relevant features to make a decision and expressing the relationships between these features is not a simple task. The decision maker must precisely define the alternatives and criteria which are more important for the decision making process. The Analytic Hierarchy Process (AHP) uses hierarchical structures to facilitate this process. The comparison is realized using pairwise matrices, which are filled in according to the decision maker judgments. Subsequently, matrix consistency is tested and priorities are obtained by calculating the matrix principal eigenvector. Given an incomplete pairwise matrix, two procedures must be performed: first, it must be completed with suitable values for the missing entries and, second, the matrix must be improved until a satisfactory level of consistency is reached. Several methods are used to fill in missing entries for incomplete pairwise matrices with correct comparison values. Additionally, once pairwise matrices are complete and if comparison judgments between pairs are not consistent, some methods must be used to improve the matrix consistency and, therefore, to obtain coherent results. In this paper a model based on the Multi-Layer Perceptron (MLP) neural network is presented. Given an AHP pairwise matrix, this model is capable of completing missing values and improving the matrix consistency at the same time.     

粗糙集的矩阵关系

将粗糙集中的集合转化为矩阵刻画,通过引入矩阵算子、类矩阵算子,借助截矩阵和关系矩阵,讨论了Paw lak粗糙集和变精度粗糙集中集合关系的矩阵计算及其所具有的一些基本性质.     

Closest normal matrix finally found!

A method of finding the closest normal matrix in the Frobenius matrix norm is developed. It is shown that if a matrix is represented in those coordinates where its closest normal matrix is diagonal, its restriction to any pair of coordinate directions is a multiple of a real diagonal and skew nondiagonal 2×2 matrix. A convergent algorithm to bring an arbitrary matrix into that form is described and results of numerical tests are reported.Dedicated to the memory of Peter Henrici (1923–1987).