L.C.Waring and M.Clint. Parallel Gram-Schmidt Orthogonalisation on a Network of Transputers. Parallel Computing, 17:1043--1050, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Sparse Givens QR Factorization on a Multiprocessor - Touriņo, Doallo, Zapata (1996) (Correct)
....these sequential algorithms have a high arithmetic complexity, the development of parallel algorithms is of considerable interest. Several parallel orthogonal factorization algorithms have been designed for various machines. We cite just a few: 3] for the Intel iPSC 1, 5] for the nCUBE 10, [9] for a network of transputers, 1] for the nCUBE 2, 2] for the CM 200, all of them for dense matrices; and [14] CM 2) 13] Fujitsu AP1000) 12] Cray T3D) for sparse matrices. We have implemented the Givens method with column pivoting for sparse matrices on the Cray T3D MIMD distributed ....
L.C.Waring and M.Clint. Parallel Gram-Schmidt Orthogonalisation on a Network of Transputers. Parallel Computing, 17:1043--1050, 1991.
Parallel Sparse Modified Gram-Schmidt QR Decomposition - Doallo, Fraguela.. (1996) (Correct)
....Since these sequential algorithms have a high arithmetic complexity, the development of parallel algorithms is of considerable interest. Several parallel orthogonal factorization algorithms have been designed for various machines. We cite just a few: 2] for the Intel iPSC 1, 3] for the nCUBE 10, [4] for a network of transputers, 5] for the nCUBE 2, 6] for the CM 200, all of them for dense matrices; and [7] CM 2) 8] Fujitsu AP1000) 9] Cray T3D) for sparse matrices. We have implemented the MGS procedure with column pivoting for sparse matrices on the Cray T3D MIMD distributed memory ....
....Parallel Algorithm The parallel algorithm developed has been generalized for any number of processing elements (PEs) and any dimension of matrix M, so that the execution for a single processor is equivalent to the sequential algorithm. We find MGS parallel algorithms for dense matrices in [3] and [4]. Matrix M is distributed onto a mesh with m Theta n PEs. Each PE is identified by coordinates (idx,idy) with 0 idx n and 0 idy m. Nonzero elements of M are mapped over PEs using a Block Column Scatter (BCS) scheme [13] but these elements are stored in one dimensional doubly linked lists ....
Waring, L.C., Clint, M.: Parallel Gram-Schmidt Orthogonalisation on a Network of Transputers. Parallel Computing, 17 (1991) 1043--1050
Sparse Givens QR Factorization on a Multiprocessor - Tourino, Doallo, Zapata (1996) (Correct)
No context found.
L.C.Waring and M.Clint. Parallel Gram-Schmidt Orthogonalisation on a Network of Transputers. Parallel Computing, 17:1043--1050, 1991.
Parallel Sparse Modified Gram-Schmidt QR Decomposition - Doallo, Fraguela.. (1996) (Correct)
No context found.
Waring, L.C., Clint, M.: Parallel Gram-Schmidt Orthogonalisation on a Network of Transputers. Parallel Computing, 17 (1991) 1043-1050
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC