论文信息 - Almost linear-time computation of the singular value decomposition using mesh-connected processors

Almost linear-time computation of the singular value decomposition using mesh-connected processors

A cyclic Jacobi method for computing the singular value decomposition of an $mxn$ matrix $(m \geq n)$ using systolic arrays is proposed. The algorithm requires $O(n^{2})$ processors and $O(m + n \log n)$ units of time.

R. Brent | C. Loan | F. Luk

[1] G. Forsythe,et al. The cyclic Jacobi method for computing the principal values of a complex matrix , 1960 .

[2] Eldon R. Hansen,et al. On Cyclic Jacobi Methods , 1963 .

[3] H. Rutishauser. The Jacobi method for real symmetric matrices , 1966 .

[4] A. Sameh. On Jacobi and Jacobi-like algorithms for a parallel computer , 1971 .

[5] Jack J. Dongarra,et al. Matrix Eigensystem Routines — EISPACK Guide Extension , 1977, Lecture Notes in Computer Science.

[6] Charles E. Leiserson,et al. Optimizing synchronous systems , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[7] H. T. Kung. Why systolic architectures? , 1982, Computer.

[8] Tony F. Chan,et al. An Improved Algorithm for Computing the Singular Value Decomposition , 1982, TOMS.

[9] Franklin T. Luk,et al. Systolic Array Computation Of The Singular Value Decomposition , 1982, Other Conferences.

[10] S. Y. Kung,et al. Linear or Square Array for Eigenvalue and Singular Value Decompositions , 1983 .

[11] Franklin T. Luk,et al. Some Linear-Time Algorithms for Systolic Arrays , 2010, IFIP Congress.

[12] Franklin T. Luk,et al. Computation Of The Generalized Singular Value Decomposition Using Mesh-Connected Processors , 1983, Optics & Photonics.

[13] H. J. Whitehouse,et al. Signal Processing Applications of Systolic Array Technology , 1983 .