Buscar
Mostrando ítems 1-3 de 3
Parallelization and compilation issues of sparse QR algorithms
(1998)
[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 ...
A PVM Based Library for Sparse Matrix Factorizations
(Springer, 1998)
[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 ...
HPF-2 Support for Dynamic Sparse Computations
(Springer, 1998)
[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 ...