activity
20052026
most citedFast Computation of the Rank Profile Matrix and the Generalized Bruhat Decomposition

14 citations · 82 across the 35 of their papers we have counts for

collaborators
Showing cs.MSShow all

5 papers · 1 filter

cs.MS2014

Elements of Design for Containers and Solutions in the LinBox Library

Brice Boyer, Jean-Guillaume Dumas, Pascal Giorgi +2

We describe in this paper new design techniques used in the \cpp exact linear algebra library \linbox, intended to make the library safer and easier to use, while keeping it generi…

cs.MS2012★ 2 cited

Rank-profile revealing Gaussian elimination and the CUP matrix decomposition

Claude-Pierre Jeannerod, Clément Pernet, Arne Storjohann

Transforming a matrix over a field to echelon form, or decomposing the matrix as a product of structured matrices that reveal the rank profile, is a fundamental building block of c…

cs.MS2011★ 11 cited

Efficient Dense Gaussian Elimination over the Finite Field with Two Elements

Martin R. Albrecht, Gregory V. Bard, Clément Pernet

In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimination upon dense matrices over the field with two elements. We discuss both wel…

cs.MS2010★ 2 cited

Efficient Decomposition of Dense Matrices over GF(2)

Martin R. Albrecht, Clément Pernet

In this work we describe an efficient implementation of a hierarchy of algorithms for the decomposition of dense matrices over the field with two elements (GF(2)). Matrix decomposi…

cs.MS2007★ 1 cited

Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm

Brice Boyer, Jean-Guillaume Dumas, Clément Pernet +1

We propose several new schedules for Strassen-Winograd's matrix multiplication algorithm, they reduce the extra memory allocation requirements by three different means: by introduc…