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.     

Classification problems for shifts on modules over a principal ideal domain

In this paper we study symbolic dynamics over alphabets which are modules over a principal ideal domain, considering topological shifts which are also submodules. Our main result is the classification, up to algebraic and topological conjugacy, of the torsion-free, transitive, finite memory shifts.

     

Optic Fiber Interferometer for Absolute Distance Measurement

1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe…     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

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

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

On the distribution singular values of Toeplitz matrices

We prove a second order formula concerning distribution of singular values of Toeplitz matrices in some cases when conditions of the H. Widom Theorem are not satisfied.

     

一类(0,1)-矩阵的最大积和式的积分表达式

给出了线和n-2的n阶（0，1）－矩阵的最大积和式的积分表达式，并证明了该积分表达式与[1]得到的组合表达式等价。     

Approximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices

A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners of otherwise similar construction, and especially so when the preconditioners are very sparse. AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30     

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