Shape preservation regions for six-dimensional spaces

We analyze the critical length for design purposes of six-dimensional spaces invariant under translations and reflections containing the functions 1, cos t and sin t. These spaces also contain the first degree polynomials as well as trigonometric and/or hyperbolic functions. We identify the spaces whose critical length for design purposes is greater than 2π and find its maximum 4π. By a change of variables, two biparametric families of spaces arise. We call shape preservation region to the set of admissible parameters in order that the space has shape preserving representations for curves. We describe the shape preserving regions for both families. To our friend Mariano Gasca on occasion of his 60th birthday Research partially supported by the Spanish Research Grant MTM2006-03388, by Gobierno de Aragón and Fondo Social Europeo.     

On two particular cases of solving the normal Hankel problem

The normal Hankel problem is one of characterizing all the complex matrices that are normal and Hankel at the same time. The matrix classes that can contain normal Hankel matrices admit a parameterization by real 2 × 2 matrices with determinant one. Here, the normal Hankel problem is solved in the case where the characteristic matrix of a given class is an order two Jordan block for the eigenvalue 1 or ?1.     

Applications of the duality method to generalizations of the Jordan canonical form

The Jordan normal form for a matrix over an arbitrary field and the canonical form for a pair of matrices under contragredient equivalence are derived using Pták's duality method.     

Jordan标准形过渡矩阵求法的补充条件

用反例证明了用方阵的特征向量逆推Jordan链构作Jordan标准形过渡矩阵的方法在理论上不成立,并给出了使这个方法成立的补充条件.     

Bounds and perturbation bounds for the matrix exponential

Some new types of bounds and perturbation bounds, based on the Jordan normal form, for the matrix exponential are derived. These bounds are compared to known bounds, both theoretically and by numerical examples. Some recent results on the matrix exponential and the logarithmic norm are also included.     

计算Pascal矩阵加数量矩阵之逆的一种新方法(英文)

In this paper,using the Jordan canonical form of the Pascal matrix Pn,we present a new approach for inverting the Pascal matrix plus a scalar Pn＋aIn for arbitrary real number a≠1.     

关于与给定矩阵可交换的矩阵的多项式表示

文[1]得到:若矩阵A的Jordan标准形中没有纯量矩阵的Jordan块,那么AB=BA的充要条件为B可以化为A的n-1次多项式.本文指出这个结论是错误的.在已有相关文献的基础上,得到了与给定矩阵A可交换的矩阵B是A的多项式的十个等价刻划.     

矩阵方程aX^2＋bX＋cIn=0的一种解法

提出了矩阵方程aX2+bX+cIn=O,a,b,c∈R且a≠0,In是n阶单位矩阵,X∈Cn×n的一种解法.首先将方程转化为Y2=O或In,然后讨论了Y的所有解,最后根据转化式,得到了原方程中X的所有解.     

The tensor t‐function: A definition for functions of third‐order tensors

A definition for functions of multidimensional arrays is presented. The definition is valid for third‐order tensors in the tensor t‐product formalism, which regards third‐order tensors as block circulant matrices. The tensor function definition is shown to have similar properties as standard matrix function definitions in fundamental scenarios. To demonstrate the definition's potential in applications, the notion of network communicability is generalized to third‐order tensors and computed for a small‐scale example via block Krylov subspace methods for matrix functions. A complexity analysis for these methods in the context of tensors is also provided.     

Graded polynomial identities for matrices with the transpose involution over an infinite field

Let F be an infinite field and let M_n(F) be the algebra of n×n matrices over F endowed with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we find a basis for the graded polynomial identities of M_n(F) with the transpose involution. Our results generalize for infinite fields of arbitrary characteristic previous results in the literature, which were obtained for the field of complex numbers and for a particular class of elementary G-gradings.     

A compound matrix algorithm for the computation of the Smith form of a polynomial matrix

In the present paper is presented a numerical method for the exact reduction of a singlevariable polynomial matrix to its Smith form without finding roots and without applying unimodular transformations. Using the notion of compound matrices, the Smith canonical form of a polynomial matrixM(s)^nxn[s] is calculated directly from its definition, requiring only the construction of all thep-compound matricesC _p (M(s)) ofM(s), 1<pn. This technique produces a stable and accurate numerical algorithm working satisfactorily for any polynomial matrix of any degree.     

A new investigation of the extended Krylov subspace method for matrix function evaluations

For large square matrices A and functions f, the numerical approximation of the action of f(A) to a vector v has received considerable attention in the last two decades. In this paper we investigate theextended Krylov subspace method, a technique that was recently proposed to approximate f(A)v for A symmetric. We provide a new theoretical analysis of the method, which improves the original result for A symmetric, and gives a new estimate for A nonsymmetric. Numerical experiments confirm that the new error estimates correctly capture the linear asymptotic convergence rate of the approximation. By using recent algorithmic improvements, we also show that the method is computationally competitive with respect to other enhancement techniques. Copyright © 2009 John Wiley & Sons, Ltd.     

关于两个矩阵之和逆阵的讨论

在数域F上的n阶矩阵环中讨论两个矩阵之和的逆阵（A＋B）-1与矩阵A,B之逆A-1,B-1的关系,给出复数域和实数域上等式（A＋B）-1=A-1＋B-1成立的充要条件.     

A Determinant Representation for the Distribution of Quadratic Forms in Complex Normal Vectors

Let the column vectors of X:: M×N, M<N, be distributed as independent complex normal vectors with the same covariance matrix Σ. Then the usual quadratic form in the complex normal vectors is denoted by Z=XLX^H where L: N×N is a positive definite hermitian matrix. This paper deals with a representation for the density function of Z in terms of a ratio of determinants. This representation also yields a compact form for the distribution of the generalized variance |Z|.     

Safety neighbournoods for the invariants of the matrix similarity

We give safety neighbourhoods for the necessary conditions in the change of the Jordan canonical form of a matrix under small perturbations. We also obtain the minimum distance from an n × n complex matrix which has less than k nonconstant invariant factors (2≤ k≤ n) to the set of matrices which have more or equal to k. When k= 2, we get in particular the distance from a nonderogatory matrix to the set of derogatory matrices.     

Closed-form solutions to the nonhomogeneous Yakubovich-conjugate matrix equation

Some closed-form solutions are provided for the nonhomogeneous Yakubovich-conjugate matrix equation with X and Y being unknown matrices. The presented solutions can offer all the degrees of freedom which is represented by an arbitrarily chosen parameter matrix. The primary feature of the solutions is that the matrices F and R are not restricted to be in any canonical form, or may be even unknown a priori. One of the solutions is neatly expressed in terms of controllability matrices and observability matrices.     

Equivalence problem for Bishop surfaces

The paper has two parts. We first briefly survey recent studies on the equivalence problem for real submanifolds in a complex space under the action of biholomorphic transformations. We will mainly focus on some of the recent studies of Bishop surfaces, which, in particular, includes the work of the authors. In the second part of the paper, we apply the general theory developed by the authors to explicitly classify an algebraic family of Bishop surfaces with a vanishing Bishop invariant. More precisely, we let M be a real submanifold of C 2 defined by an equation of the form w = zz + 2Re(z s + az s+1 ) with s≥ 3 and a a complex parameter. We will prove in the second part of the paper that for s≥ 4 two such surfaces are holomorphically equivalent if and only if the parameter differs by a certain rotation. When s = 3, we show that surfaces of this type with two different real parameters are not holomorphically equivalent.     

求矩阵到其Jordan标准形的过渡矩阵的新算法

本文给出了一种求矩阵到其Ｊｏｒｄａｎ标准形的过渡矩阵的新算法，与其它现有的算法相比，此算法最简单有效，且最易于编制程序以利用计算机计算．