Sciweavers

Share
PC
2002

On parallel block algorithms for exact triangularizations

8 years 11 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplication, our algorithm has the best known sequential arithmetic complexity. Furthermore, on distributed architectures, it drastically reduces the total volume of communication compared to previously known algorithms. The resulting matrix can be used to compute the rank or to solve a linear system. Over finite fields, for instance, our method has proven useful in the computation of large Gr
Jean-Guillaume Dumas, Jean-Louis Roch
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where PC
Authors Jean-Guillaume Dumas, Jean-Louis Roch
Comments (0)
books