Iterative solutions to coupled Sylvester-transpose matrix equations

This note studies the iterative solutions to the coupled Sylvester-transpose matrix equation with a unique solution. By using the hierarchical identification principle, an iterative algorithm is presented for solving this class of coupled matrix equations. It is proved that the iterative solution consistently converges to the exact solution for any initial values. Meanwhile, sufficient conditions are derived to guarantee that the iterative solutions given by the proposed algorithm converge to the exact solution for any initial matrices. Finally, a numerical example is given to illustrate the efficiency of the proposed approach.     

Weighted differentiation composition operator from logarithmic Bloch spaces to Bloch‐type spaces

In this paper, we give a new characterization for the boundedness of weighted differentiation composition operator from logarithmic Bloch spaces to Bloch‐type spaces and calculate its essential norm in terms of the n‐th power of induced analytic self‐map on the unit disk. From which a sufficient and necessary condition of compactness of this operator follows immediately.     

Commutator inequalities associated with the polar decomposition

Let be a polar decomposition of an complex matrix . Then for every unitarily invariant norm , it is shown that

where denotes the operator norm. This is a quantitative version of the well-known result that is normal if and only if . Related inequalities involving self-commutators are also obtained.

     

Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm

The structure preserving rank reduction problem arises in many important applications. The singular value decomposition (SVD), while giving the closest low rank approximation to a given matrix in matrix L ₂ norm and Frobenius norm, may not be appropriate for these applications since it does not preserve the given structure. We present a new method for structure preserving low rank approximation of a matrix, which is based on Structured Total Least Norm (STLN). The STLN is an efficient method for obtaining an approximate solution to an overdetermined linear system AX B, preserving the given linear structure in the perturbation [E F] such that (A + E)X = B + F. The approximate solution can be obtained to minimize the perturbation [E F] in the L _p norm, where p = 1, 2, or . An algorithm is described for Hankel structure preserving low rank approximation using STLN with L _p norm. Computational results are presented, which show performances of the STLN based method for L ₁ and L ₂ norms for reduced rank approximation for Hankel matrices.     

Criteria for Validity of the Maximum Norm Principle for Parabolic Systems

We consider systems of partial differential equations, which contain only second derivatives in the x variables and which are uniformly parabolic in the sense of Petrovskii. For such systems we obtain necessary and, separately, sufficient conditions for the maximum norm principle to hold in the layer Rn × ( 0,T ] and in the cylinder × ( 0,T], where is a bounded subdomain of Rn. In this paper the norm is understood in a generalized sense, i.e. as the Minkowski functional of a compact convex body in Rm containing the origin. The necessary and sufficient conditions coincide if the coefficients of the system do not depend on t. The criteria for validity of the maximum norm principle are formulated as a number of equivalent algebraic conditions describing the relation between the geometry of the unit sphere of the given norm and coefficients of the system under consideration. Simpler formulated criteria are given for certain classes of norms: for differentiable norms, p-norms ( 1 p ) in Rm, as well as for norms whose unit balls are m-pyramids, m-bipyramids, cylindrical bodies, m-parallelepipeds. The case m = 2 is studied separately.     

四元数矩阵方程AX-YB=C的最佳逼近解

本利用四元数矩阵的广义Frobenius范数建立一个关于四元数矩阵的实函数，并讨论了它的极值问题．然后在四元数矩阵方程AX-YB=C的解集合中导出了与给定矩阵的最佳逼近解的表达式．     

On fuzzy subgroups and fuzzy ideals under triangular norms

In this communication, we explicitly point out that the principal results of Liu 1982 basically deduced from the definition of binary operation ° on the set F(X) of all fuzzy subsets of X, also hold if one uses the weaker definition of product under triangular norm °_t. Fuzzy ideals with respect to the triangular norms are also defined.