Randomized algorithms are given for linear algebra problems on an input matrix A ∈ K n×m over a field K. We give an algorithm that simultaneously computes the row and column rank profiles of A in 2r 3 + (r 2 + n + m + |A|) 1+o(1) field op- General Terms Algorithms Keywords Linear system, rank profile, rank, sparse matrix Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for

more »

... rofit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org.