scispace - formally typeset
Search or ask a question

Showing papers by "Michael K. Ng published in 1994"


Journal ArticleDOI
TL;DR: The proposed circulant preconditioners are derived from the spectral property of the given stationary process and can be modified to suit the applications of recursive least squares computations with the proper use of sliding window method arising in signal processing applications.
Abstract: Least squares estimations have been used extensively in many applications, e.g. system identification and signal prediction. When the stochastic process is stationary, the least squares estimators can be found by solving a Toeplitz or near-Toeplitz matrix system depending on the knowledge of the data statistics. In this paper, we employ the preconditioned conjugate gradient method with circulant preconditioners to solve such systems. Our proposed circulant preconditioners are derived from the spectral property of the given stationary process. In the case where the spectral density functions(θ) of the process is known, we prove that ifs(θ) is a positive continuous function, then the spectrum of the preconditioned system will be clustered around 1 and the method converges superlinearly. However, if the statistics of the process is unknown, then we prove that with probability 1, the spectrum of the preconditioned system is still clustered around 1 provided that large data samples are taken. For finite impulse response (FIR) system identification problems, our numerical results show that annth order least squares estimator can usually be obtained inO(n logn) operations whenO(n) data samples are used. Finally, we remark that our algorithm can be modified to suit the applications of recursive least squares computations with the proper use of sliding window method arising in signal processing applications.

5 citations


Proceedings ArticleDOI
28 Oct 1994
TL;DR: A method to generalize Strang's circulant preconditioner for arbitrary n-by-n matrices An, similar to the forward-backward projection method used in constructing preconditionsers for tomographic inversion problems in medical imaging is proposed.
Abstract: In this paper, we proposed a method to generalize Strang's circulant preconditioner for arbitrary n-by-n matrices An. The [n/2]th column of our circulant preconditioner Sn is equal to the [n/2]th column of the given matrix An. Thus if An is a square Toeplitz matrix, then Sn is just the Strang circulant preconditioner. When Sn is not Hermitian, our circulant preconditioner can be defined as (S*nSn)1/2. This construction is similar to the forward-backward projection method used in constructing preconditioners for tomographic inversion problems in medical imaging. Comparisons of our preconditioner Sn with other circulant-based preconditioners are carried out for some 1D Toeplitz least squares problems: minb - Ax2. Preliminary numerical results show that Sn performs quite well. Test results are also reported for a 2D deconvolution problem arising in ground-based atmospheric imaging.© (1994) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

2 citations