Simultaneous computation of the row and column rank profiles

Jean-Guillaume Dumas 1, * Clément Pernet 2, * Ziad Sultan 2, 1, *
* Corresponding author
2 MOAIS - PrograMming and scheduling design fOr Applications in Interactive Simulation
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00778136
Contributor : Jean-Guillaume Dumas <>
Submitted on : Friday, January 18, 2013 - 5:43:01 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM
Long-term archiving on : Saturday, April 1, 2017 - 7:18:17 AM

Files

pluq_report.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

1294

Files downloads

279