Additive Hermitian idempotent preservers between operator algebras

Let L be an additive map between (real or complex) matrix algebras sending $n\times n$ Hermitian idempotent matrices to $m\times m$ Hermitian idempotent matrices. We show that there are nonnegative integers $p,q$ with $n(p+q)=r\le m$ and an $m\times m$ unitary matrix U such that$L(A)=U[(I_p?A)\oplus (I_q?A^t)\oplus 0_{m?r}]U^{?},\text{for any}n\times n\text{Hermitian}A\text{with rational trace}.$ We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism.     

非负定阵元素的扰动和正定完备化

在保持非负定性不变的前提下,本文对矩阵每一元素容许多大的扰动作了进一步的研究, 将本文的结论和C．R．Johnson提出的部分正定阵的正定完备化进行比较,容易发现对已知的正定矩阵求扰动,本文的结论比用C．R.Johnson的正定完备化计算扰动形式上更简单,同时也给出了不同于C．R．Johnson的部分正定阵的正定完备化表示的另外一个公式,推出了这些正定完备化矩阵应具有的若干性质．     

Semi‐analytical integration of the 8‐node plane element stiffness matrix using symbolic computation

The semi‐analytical integration of an 8‐node plane strain finite element stiffness matrix is presented in this work. The element is assumed to be super‐parametric, having straight sides. Before carrying out the integration, the integral expressions are classified into several groups, thus avoiding duplication of calculations. Symbolic manipulation and integration is used to obtain the basic formulae to evaluate the stiffness matrix. Then, the resulting expressions are postprocessed, optimized, and simplified in order to reduce the computation time. Maple symbolic‐manipulation software was used to generate the closed expressions and to develop the corresponding Fortran code. Comparisons between semi‐analytical integration and numerical integration were made. It was demonstrated that semi‐analytical integration required less CPU time than conventional numerical integration (using Gaussian‐Legendre quadrature) to obtain the stiffness matrix. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Fractions continues de matrices,convergence et applications

The aim of this article is to give some property of continued fraction with matrices arguments, about their convergence and others applications. At the end of this work, we present a resolution of the Algebraic Riccati Equation by giving an explicit continued fraction development of its solution. This revised version was published online in August 2006 with corrections to the Cover Date.     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．     

The linear polarization constant of R n

Summary He present work deals with estimations of the n-th linear polarization constant c(H)_n of an n-dimensional real Hilbert space H. We provide some new lower bounds on the value of sup_║y║=1 │1,y> ... n,y>│, where x₁, ... ,x_n are unit vectors in H. In particular, the results improve an earlier estimate of Marcus. However, the intriguing conjecture c(H) _n= n^n/2 remains open.     

Involutions for upper triangular matrix algebras

In this paper we describe completely the involutions of the first kind of the algebra UT_n(F) of n×n upper triangular matrices. Every such involution can be extended uniquely to an involution on the full matrix algebra. We describe the equivalence classes of involutions on the upper triangular matrices. There are two distinct classes for UT_n(F) when n is even and a single class in the odd case.Furthermore we consider the algebra UT₂(F) of the 2×2 upper triangular matrices over an infinite field F of characteristic different from 2. For every involution *, we describe the *-polynomial identities for this algebra. We exhibit bases of the corresponding ideals of identities with involution, and compute the Hilbert (or Poincaré) series and the codimension sequences of the respective relatively free algebras.Then we consider the *-polynomial identities for the algebra UT₃(F) over a field of characteristic zero. We describe a finite generating set of the ideal of *-identities for this algebra. These generators are quite a few, and their degrees are relatively large. It seems to us that the problem of describing the *-identities for the algebra UT_n(F) of the n×n upper triangular matrices may be much more complicated than in the case of ordinary polynomial identities.     

Liquid phase oxidation of p-chlorotoluene to p-chlorobenzaldehyde over cobalt-doped mesoporous titania with a crystalline framework

Cobalt-doped mesoporous titania with a crystalline framework synthesized by surfactant templating method presented highly selective (99%) and reasonable conversion rate (49%) of catalytic oxidation of para-chlorotoluene to para-chlorobenzaldehyde in acetic acid using aqueous hydrogen peroxide as oxidant for the first time. Recycling of the catalyst indicates that the catalyst can be used a number of times without losing its activity to a greater extent. By contrast, cobalt-doped mesoporous titania without a crystalline structure and cobalt doped the commercial titania, Degussa P25 prepared by impregnation method with the similar concentration of cobalt were found inactive. The effects of catalyst concentration, reaction time, reaction temperature, and solvents on the performance of the catalyst were also investigated.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.