A parallel block algorithm for exact triangularization of rectangular matrices

Authors:
Jean-Guillaume Dumas;Jean-Louis Roch
Affiliations:
Laboratoire Informatique et Distribution, ENSIMAG - antenne de Montbonnot. ZIRST - 51, av. Jean, Kuntzmann, 38330 Montbonnot Saint-Martin, France;Laboratoire Informatique et Distribution, ENSIMAG - antenne de Montbonnot. ZIRST - 51, av. Jean, Kuntzmann, 38330 Montbonnot Saint-Martin, France
Venue:
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2001

Citing 3
Cited 2

A fast parallel algorithm to compute the rank of a matrix over an arbitrary field

Combinatorica
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms

PARA '98 Proceedings of the 4th International Workshop on Applied Parallel Computing, Large Scale Scientific and Industrial Problems

On parallel block algorithms for exact triangularizations

Parallel Computing
Finite field linear algebra subroutines

Proceedings of the 2002 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new block algorithm for triangularization of regular or singular matrices with dimension m × n is proposed. Taking benefit of fast block multiplication algorithms, it achieves the best known sequential complexity &Ogr;(mw-1n) for any sizes and any rank. Moreover, the block strategy enables to improve locality with respect to previous algorithms as exhibited by practical performances.