An iterative algorithm for the centrosymmetric solutions and optimal approximation of AXB+CXD=F;

In this paper,an iterative method is presented to find the least squares centrosymmetric solution to a kind of matrix equations.

In this paper, the convergence of iterative methods for the linear system Ax=b is investigated, where A is a centrosymmetric M-matrix.

The concepts in References 1 and 2 are broadened and the properties of the centrosymmetric and skew centrosymmetric matrices are exploited in detail.

Three centrosymmetric 4,4\'-bis(N\'-substituted acylthioureido)biphenyls were synthesized by the 1.

A clustering algorithm based on central symmetry;

The heavy integral of the successive function of central symmetry;

Based on the depth research on extension array manifold of uniform circular, for some uniform circular arrays which had subarrays with the nature of rotational invariance and had the nature of central symmetry two ESPRIT algo-rithms were presented, the first algorithm reduced one time of SVD, the second algorithm avoided parameter pairs.

Through further research, the writer found out the relationship of distances between two odd prime numbers and the two symccntcrs of the same odd prime number, and the relationship between the distance of the symcenters between two odd prime numbers and the same odd prime number and the distance between the .