Simultaneous computation of the row and column rank profiles - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Simultaneous computation of the row and column rank profiles


Gaussian elimination with full pivoting generates a PLUQ matrix decomposition. Depending on the strategy used in the search for pivots, the permutation matrices can reveal some information about the row or the column rank profiles of the matrix. We propose a new pivoting strategy that makes it possible to recover at the same time both row and column rank profiles of the input matrix and of any of its leading sub-matrices. We propose a rank-sensitive and quad-recursive algorithm that computes the latter PLUQ triangular decomposition of an m × n matrix of rank r in O(mnr^{ω−2}) field operations, with ω the exponent of matrix multiplication. Compared to the LEU decomposition by Malashonock, sharing a similar recursive structure, its time complexity is rank sensitive and has a lower leading constant. Over a word size finite field, this algorithm also improveLs the practical efficiency of previously known implementations.
Fichier principal
Vignette du fichier
pluq_report.pdf (449.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00778136 , version 1 (18-01-2013)



Jean-Guillaume Dumas, Clément Pernet, Ziad Sultan. Simultaneous computation of the row and column rank profiles. ISSAC 2013 - 38th International Symposium on Symbolic and Algebraic Computation, Jun 2013, Boston, MA, United States. pp.181-188, ⟨10.1145/2465506.2465517⟩. ⟨hal-00778136⟩
836 View
220 Download



Gmail Facebook X LinkedIn More