TY - GEN

T1 - An algorithm for computing the pisarenko vector

AU - Hasan, Mohammed A.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - The problem of computing the minimum eigenvector (the Pisarenko vector) of a covariance matrix is of considerable interest in signal processing and computational linear algebra. In this paper, a unified algorithm for computing both the minimum and maximum eigenpairs by simply choosing the proper initial condition is proposed. In particular, the extremum eigenpairs are computed using higher order convergent methods which include the Newton method, the Halley and root iterations. The advantage of these methods is that one can control where the methods converge by choosing a proper initial condition. Some of the methods are implemented using the QR factorization to avoid matrix inversion. By appropriately choosing the initial condition, this approach can also be used to compute the largest eigenpair and thus can be applied for computing the minor and major subspaces of symmetric or hermitian matrices. Procedures such as the double step Newton method for accelerating the developed methods are considered. Several randomly generated test problems are used to evaluate the performance of the methods.

AB - The problem of computing the minimum eigenvector (the Pisarenko vector) of a covariance matrix is of considerable interest in signal processing and computational linear algebra. In this paper, a unified algorithm for computing both the minimum and maximum eigenpairs by simply choosing the proper initial condition is proposed. In particular, the extremum eigenpairs are computed using higher order convergent methods which include the Newton method, the Halley and root iterations. The advantage of these methods is that one can control where the methods converge by choosing a proper initial condition. Some of the methods are implemented using the QR factorization to avoid matrix inversion. By appropriately choosing the initial condition, this approach can also be used to compute the largest eigenpair and thus can be applied for computing the minor and major subspaces of symmetric or hermitian matrices. Procedures such as the double step Newton method for accelerating the developed methods are considered. Several randomly generated test problems are used to evaluate the performance of the methods.

UR - http://www.scopus.com/inward/record.url?scp=84949206675&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949206675&partnerID=8YFLogxK

U2 - 10.1109/SAM.2002.1190992

DO - 10.1109/SAM.2002.1190992

M3 - Conference contribution

AN - SCOPUS:84949206675

T3 - Proceedings of the IEEE Sensor Array and Multichannel Signal Processing Workshop

SP - 23

EP - 27

BT - 2002 IEEE Sensor Array and Multichannel Signal Processing Workshop Proceedings, SAME 2002

PB - IEEE Computer Society

T2 - IEEE Sensor Array and Multichannel Signal Processing Workshop, SAME 2002

Y2 - 4 August 2002 through 6 August 2002

ER -