• The Pure and Applied Mathematics
• /
• v.18 no.3
• /
• pp.185-199
• /
• 2011

In this paper, we present a new extended Jacobi method for computing eigenvalues and eigenvectors of Hermitian matrices which does not use any complex arithmetics. This method can be readily applied to skew-Hermitian and real skew-symmetric matrices as well. An example illustrating its computational efficiency is given.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.253-260
• /
• 2005

Denote the set of n ${\times}$ n complex Hermitian matrices by Hn. A pair of n ${\times}$ n Hermitian matrices (A, B) is said to be rank-additive if rank (A+B) = rank A+rank B. We characterize the linear maps from Hn into itself that preserve the set of rank-additive pairs. As applications, the linear preservers of adjoint matrix on Hn and the Jordan homomorphisms of Hn are also given. The analogous problems on the skew Hermitian matrix space are considered.

• Journal of applied mathematics & informatics
• /
• v.31 no.3_4
• /
• pp.545-558
• /
• 2013

In this paper, the formulas for calculating the extremal ranks and inertias of the Hermitian least squares solutions to matrix equation AX = B are established. In particular, the necessary and sufficient conditions for the existences of the positive and nonnegative definite solutions to this matrix equation are given. Meanwhile, the least squares problem of the above matrix equation with Hermitian R-symmetric and R-skew symmetric constraints are also investigated.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1167-1178
• /
• 2011

In this paper, we further investigate the local Hermitian and skew-Hermitian splitting (LHSS) iteration method and the modified LHSS (MLHSS) iteration method for solving generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. When A is non-symmetric positive definite, the convergence conditions are obtained, which generalize some results of Jiang and Cao [M.-Q. Jiang and Y. Cao, On local Hermitian and Skew-Hermitian splitting iteration methods for generalized saddle point problems, J. Comput. Appl. Math., 2009(231): 973-982] for the generalized saddle point problems to generalized nonsymmetric saddle point problems with nonzero (2,2) blocks. Numerical experiments show the effectiveness of the iterative methods.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.471-471
• /
• 2000

This paper presents a new kurtosis-based algorithm for blind separation of convolutively mixed source signals. The algorithm whitens the signals not only spatially but also temporally beforehand. A separator is built for the whitened signals and it exists in the set of para-unitary matrices. Since the set forms a curved manifold, it is hard to treat its elements. In order to avoid the difficulty, this paper introduces the Cayley transformation for the para-unitary matrices. The transformed matrix is referred to as para-skew-Hermitian matrix and the set of such matrices forms a linear space. In the set of all para-skew-Hermitian matrices, the kurtosis-based algorithm obtains a desired separator. This paper also shows the algorithm's application to electrogastrogram datum which are observed by 4 electrodes on subjects' abdomen around their stomachs. An electrogastrogram contains signals from a stomach and other organs. This paper obtains independent components by the algorithm and then extracts the signal corresponding to the stomach from the data.