Now showing items 1-6 of 6
HPF-2 Support for Dynamic Sparse Computations
[Abstract] There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and involve row and column operations ...
A PVM Based Library for Sparse Matrix Factorizations
[Abstract] We present 3LM, a C Linked List Management Library for parallel sparse factorizations on a PVM environment which takes into account the fill-in, an important drawback of sparse computations. It is restricted to ...
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 ...
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 ...
Parallelization and compilation issues of sparse QR algorithms
[Resumen] La tesis doctoral se centra en el estudio y desarrollo de métodos eficientes para la paralelización de algoritmos de factorización QR de matrices dispersas, La descomposición QR tiene diversas aplicaciones ...
Parallel Sparse Modified Gram-Schmidt QR Decomposition
[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 ...