AbstractThis paper discusses an extension of the pipelined Givens method for computing the QR factorization of a real m×n matrix to the case in which the matrix is sparse. When restricted to one process, the algorithm performs the same computation as the serial sparse Givens algorithm of George and Heath. Our implementation is compatible with the data structures used in sparspak. The pipelined algorithm is well suited to parallel computers having globally shared memory and low-overhead synchronization primitives, such as the Denelcor HEP, for which computational results are presented. We point out certain synchronization problems that arise in the adaptation to the sparse setting and discuss the effect on parallel speedup of accessing a ser...
We present the techniques of adaptive blocking and incremental condition estimation which we believ...
arallel strategies based on Givens rotations are proposed for updating the QR decomposition of an n ...
Texte intégral accessible uniquement aux membres de l'Université de LorraineThis dissertation treats...
AbstractThis paper discusses an extension of the pipelined Givens method for computing the QR factor...
We present a parallel algorithm for the QR factorization with column pivoting of a sparse matrix by ...
This manuscript focuses on the development of a parallel QR-factorization of structured rank matrice...
Sparse linear systems occur in areas such as finite element methods and statistics. These system...
. We present a parallel algorithm for the QR decomposition with column pivoting of a sparse matrix b...
SuiteSparseQR is a sparse multifrontal QR factorization algorithm. Dense matrix methods within each ...
International audienceThe advent of multicore processors represents a disruptive event in the histor...
International audienceSolving linear equations of type Ax=b for large sparse systems frequently emer...
Abstra t. We present algorithms to determine the number of nonzeros in ea h row and olumn of the fa...
AbstractThe matrix-vector multiplication operation is the kernel of most numerical algorithms.Typica...
This paper introduces an algorithm for computing a QR decomposition of a polynomial matrix. The algo...
In QR factorization of a sparse m{times}n matrix A (m {ge} n) the orthogonal factor Q is often store...
We present the techniques of adaptive blocking and incremental condition estimation which we believ...
arallel strategies based on Givens rotations are proposed for updating the QR decomposition of an n ...
Texte intégral accessible uniquement aux membres de l'Université de LorraineThis dissertation treats...
AbstractThis paper discusses an extension of the pipelined Givens method for computing the QR factor...
We present a parallel algorithm for the QR factorization with column pivoting of a sparse matrix by ...
This manuscript focuses on the development of a parallel QR-factorization of structured rank matrice...
Sparse linear systems occur in areas such as finite element methods and statistics. These system...
. We present a parallel algorithm for the QR decomposition with column pivoting of a sparse matrix b...
SuiteSparseQR is a sparse multifrontal QR factorization algorithm. Dense matrix methods within each ...
International audienceThe advent of multicore processors represents a disruptive event in the histor...
International audienceSolving linear equations of type Ax=b for large sparse systems frequently emer...
Abstra t. We present algorithms to determine the number of nonzeros in ea h row and olumn of the fa...
AbstractThe matrix-vector multiplication operation is the kernel of most numerical algorithms.Typica...
This paper introduces an algorithm for computing a QR decomposition of a polynomial matrix. The algo...
In QR factorization of a sparse m{times}n matrix A (m {ge} n) the orthogonal factor Q is often store...
We present the techniques of adaptive blocking and incremental condition estimation which we believ...
arallel strategies based on Givens rotations are proposed for updating the QR decomposition of an n ...
Texte intégral accessible uniquement aux membres de l'Université de LorraineThis dissertation treats...