A preconditioner for constrained and weighted least squares problems with Toeplitz structure

We study methods for solving the constrained and weighted least squares problem min_x by the preconditioned conjugate gradient (PCG) method. HereW = diag (₁, , _m) with _{1 m} 0, andA^T = [T₁^T, ,T_k^T] with Toeplitz blocksT_l R^{n × n},l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A^T = 0, whereM =W^–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E.