A parallel block algorithm for exact triangularization of rectangular matrices
Jean‐Guillaume Dumas, Jean-Louis Roch · 2001
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 Ο(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.