Abstract | ||
---|---|---|
A parallel algorithm for computing the generalized singular value decomposition of two matrices A and B having the same number of columns is described in this paper. The algorithm is designed for efficient implementation on distributed-memory parallel computer architectures. The time cost is O(n2) units for parallel preprocessing, and O(n2/p) units for the GSVD of two upper trapezoidal matrices, where p is the dimension of the triangular array of processors. |
Year | DOI | Venue |
---|---|---|
1994 | 10.1006/jpdc.1994.1027 | Journal of Parallel and Distributed Computing |
Keywords | DocType | Volume |
parallel algorithm | Journal | 20 |
Issue | ISSN | Citations |
3 | 0743-7315 | 2 |
PageRank | References | Authors |
0.52 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zhaojun Bai | 1 | 661 | 107.69 |