<p>Let $A$ be a matrix where $A \in \mathbb{F}^{n^s \times n^s}$ and $s&gt;2$.
Assume $A$ is a sparse matrix where its rank  $\leq n$ and that there is only constant number of non-zero elements in each row.
The positions of the non-zero elements are predefined.</p>

<p>My question:  How can I fill a matrix of size $n \times n$ with an equal rank that each value is computed from the original matrix, where the complexity of that building would be $O(n^2)$? 
(randomized algorithms can also be considered)</p>

CC BY-SA 3.0
2017-06-05T18:33:05.707Z
@D.W. I made an edit.  You can't pick a random matrix. and it would be impossible to compute rank in a regular manner as the complexity would exceed the limit of $O(n^2)$
user1387682
CC BY-SA 3.0
2017-06-06T06:27:50.057Z
I thought that the values will be a predefined gauss elimination values. BUT as I don't know the values of the matrix values before I'm prebuilding it (I.e which one is zero) I can't it doesn't looks like the it will fit. My direction is towards randomized algorithm ( fill the values with some randomize linear combination that might give a rank and can be easily computed).
user1387682
CC BY-SA 3.0
2017-06-06T06:30:38.573Z
As I mentioned to build an $n \times n$ matrix, you must compute the rank first on the large matrix and this is what I'm trying to prevent because of the high complexity of it.
user1387682
CC BY-SA 3.0
2017-06-06T07:53:44.637Z
OK.  It might be helpful to edit the question to include that information.  What is the best algorithm you know so far?  How fast is it?  What's the fastest algorithm you can find to compute the rank of $A$, given its special structure?
D.W.
<complexity><sparse-matrix>
How to shrink a very large sparse matrix
user1387682
# How to shrink a very large sparse matrix

(Asked by: username_0 on 2017-06-04)

Let $A$ be a matrix where $A \in \mathbb{F}^{n^s \times n^s}$ and $s>2$.
Assume $A$ is a sparse matrix where its rank $\leq n$ and that there is only constant number of non-zero elements in each row.
The positions of the non-zero elements are predefined.

My question: How can I fill a matrix of size $n \times n$ with an equal rank that each value is computed from the original matrix, where the complexity of that building would be $O(n^2)$?
(randomized algorithms can also be considered)

**Tags:** complexity, sparse-matrix

> **Comments:**
> **username_0**: @username_1 I made an edit.  You can't pick a random matrix. and it would be impossible to compute rank in a regular manner as the complexity would exceed the limit of $O(n^2)$  
> **username_0**: I thought that the values will be a predefined gauss elimination values. BUT as I don't know the values of the matrix values before I'm prebuilding it (I.e which one is zero) I can't it doesn't looks like the it will fit. My direction is towards randomized algorithm ( fill the values with some randomize linear combination that might give a rank and can be easily computed).  
> **username_0**: As I mentioned to build an $n \times n$ matrix, you must compute the rank first on the large matrix and this is what I'm trying to prevent because of the high complexity of it.  
> **username_1**: OK.  It might be helpful to edit the question to include that information.  What is the best algorithm you know so far?  How fast is it?  What's the fastest algorithm you can find to compute the rank of $A$, given its special structure?  

---

## 0 answers

