Normal equivalent to an arbitrary diagonalizable matrix

The aim of this paper is to reduce the eigenvalue problem of a diagonalizable matrix to the eigenvalue problem of an equivalent normal matrix. We use for this purpose a minimization strategy, which is also applicable for transforming an arbitrary nondiagonalizable matrix to an almost normal one.     

On the Toeplitz embedding of an arbitrary matrix

It has been shown by Delosme and Morf that an arbitrary block matrix can be embedded into a block Toeplitz matrix; the dimension of this embedding depends on the complexity of the matrix structure compared to the block Toeplitz structure. Due to the special form of the embedding matrix, the algebra of matrix polynomials relative to block Toeplitz matrices can be interpreted directly in terms of the original matrix and therefore can be extended to arbitrary matrices. In fact, these polynomials turn out to provide an appropriate framework for the recently proposed generalized Levinson algorithm solving the general matrix inversion problem.     

Parallel factorizations of matrix polynomials over an arbitrary field

We study the problem of the decomposition of a matrix polynomial over an arbitrary field into a product of factors of lower degrees with preassigned characteristic polynomials. We find necessary conditions for the existence of the required factorization, which are also sufficient for certain classes of matrix polynomials. The proposed method makes it possible to solve the problem completely for matrix polynomials with one nonconstant invariant factor. Translated fromMatematichni Metody i Fiziko-Mekhanichni Polya, Vol. 38, 1995.     

The eigenstructure of an arbitrary polynomial matrix: computational aspects

We give a new numerical method to compute the eigenstructure—i.e. the zero structure, the polar structure, and the left and right null space structure—of a polynomial matrix P(λ). These structural elements are of fundamental importance in several systems and control problems involving polynomial matrices. The approach is more general than previous numerical methods because it can be applied to an arbitrary m × n polynomial matrix P(λ) with normal rank r smaller than m and/or n. The algorithm is then shown to compute the structure of the left and right null spaces of P(λ) as well. The speed and accuracy of this new approach are also discussed.     

Monotone additive matrix transformations

We investigate additive transformations on the space of real or complex matrices that are monotone with respect to any admissible partial order relation. A complete characterization of these transformations is obtained. In the real case, we show that such transformations are linear and that all nonzero monotone transformations are bijective. As a corollary, we characterize all additive transformations that are monotone with respect to certain classical matrix order relations, in particular, with respect to the Drazin order, left and right *-orders, and the diamond order.     

Multivariate matrix refinable functions with arbitrary matrix dilation

Characterizations of the stability and orthonormality of a multivariate matrix refinable function with arbitrary matrix dilation are provided in terms of the eigenvalue and -eigenvector properties of the restricted transition operator. Under mild conditions, it is shown that the approximation order of is equivalent to the order of the vanishing moment conditions of the matrix refinement mask . The restricted transition operator associated with the matrix refinement mask is represented by a finite matrix , with and being the Kronecker product of matrices and . The spectral properties of the transition operator are studied. The Sobolev regularity estimate of a matrix refinable function is given in terms of the spectral radius of the restricted transition operator to an invariant subspace. This estimate is analyzed in an example.

     

Characterization of commutative matrix subalgebras of maximal length over an arbitrary field

Commutative subalgebras of length n − 1 in the full matrix algebra of order n over an arbitrary field are characterized in terms of generating elements.     

A generalization of the implicit LU algorithm to an arbitrary initial matrix

The implicit LU algorithm of the (basic) ABS class corresponds to the parameter choices H ₁=I, z _i =w _i =e _i . The algorithm can be considered as the ABS version of the classic LU factorization algorithm. In this paper we consider the generalization where the initial matrix H₁ is arbitrary except for a certain condition. We prove that every algorithm in the ABS class is equivalent, in the sense of generating the same set of search directions, to a generalized implicit LU algorithm, with suitable initial matrix, that can be interpreted as a right preconditioning matrix. We discuss some consequences of this result, including a straightforward derivation of Bienaymé's (1853) classical result on the equivalence of the Gram–Schmidt orthogonalization procedure with Gaussian elimination on the normal equations. This revised version was published online in June 2006 with corrections to the Cover Date.     

矩阵代数上的局部合同变换和局部相似变换

令F表示任意域,Mn（F）表示由F上所有n×n矩阵形成的结合代数.本文的目的是研究Mn（F）上具有如下性质的两类线性映射,其中一类线性映射在Mn（F）上每一点的取值与Mn（F）的某个合同变换在该点的取值相同,另一类线性映射在Mn（F）上每一点的取值与Mn（F）的某个相似变换在该点的取值相同,随着Mn（F）上的点不同,这些合同变换和相似变换可能也不同.利用矩阵的秩、幂等阵以及幂零阵的性质,通过矩阵计算的方法证明了第一类线性映射或者是合同变换或者是合同变换与转置变换的复合,第二类线性映射或者是相似变换或者是相似变换与转置变换的复合.由这个结果可知存在真正意义上的局部合同变换和局部相似变换,从而丰富了局部映射理论的研究。     

On matrix transformations and sequence spaces

In this paper are given results on the spacesw _τ (μ) andc _τ (μ, μ′) the second one generalizing the well-known spacec _∞ (μ) of sequences that are strongly bounded. Then we deal with matrix transformations into these spaces. These results generalize those given in [7].     

Synchronizing chaotic systems up to an arbitrary scaling matrix via a single signal

This paper introduces a novel type of synchronization, where two chaotic systems synchronize up to an arbitrary scaling matrix. In particular, each drive system state synchronizes with a linear combination of response system states by using a single synchronizing signal. The proposed observer-based method exploits a theorem that assures asymptotic synchronization for a wide class of continuous-time chaotic (hyperchaotic) systems. Two examples, involving Rössler’s system and a hyperchaotic oscillator, show that the proposed technique is a general framework to achieve any type of synchronization defined to date.