Procrustes problems for general,triangular,and symmetric toeplitz matrices

The toeplitz procrustes problems are the least squares problems for the matrix equation a x = b over some toeplitz matrix sets. in this paper the necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions of the toeplitz procrustes problems when the unknown matrices are constrained to the general,the triangular,and the symmetric toeplitz matrices,respectively. the algorithms are designed and the numerical examples show that these algorithms are feasible. © 2013 juan yang and yuan-bei deng.