Buscar
Mostrando ítems 1-3 de 3
Sparse Givens QR Factorization on a Multiprocessor
(IEEE Computer Society, 1996-06-01)
[Abstract]
We present a parallel algorithm for the QR factorization with column pivoting of a sparse matrix by means of Givens rotations. Nonzero elements of the matrix M to be decomposed are stored in a one dimensional ...
Parallel Sparse Modified Gram-Schmidt QR Decomposition
(Springer, 1996)
[Abstract] We present a parallel computational method for the QR decomposition with column pivoting of a sparse matrix by means of Modified Gram-Schmidt orthogonalization. Nonzero elements of the matrix M to be decomposed ...
Sparse Householder QR factorization on a mesh
(IEEE Computer Society, 1996-01)
[Abstract] We analyze the parallelization of QR factorization by means of Householder transformations. This parallelization is carried out on a machine with a mesh topology (a 2-D torus to be more precise). We use a cyclic ...