Dynamic matrix rank with partial lookahead
Contribuinte(s) |
Hariharan, R Mukund, M Vinay, V |
---|---|
Data(s) |
2008
|
Resumo |
We consider the problem of maintaining information about the rank of a matrix $M$ under changes to its entries. For an $n \times n$ matrix $M$, we show an amortized upper bound of $O(n^{\omega-1})$ arithmetic operations per change for this problem, where $\omega < 2.376$ is the exponent for matrix multiplication, under the assumption that there is a {\em lookahead} of up to $\Theta(n)$ locations. That is, we know up to the next $\Theta(n)$ locations $(i_1,j_1),(i_2,j_2),\ldots,$ whose entries are going to change, in advance; however we do not know the new entries in these locations in advance. We get the new entries in these locations in a dynamic manner. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/40704/1/Dynamic.pdf Kavitha, Telikepalli (2008) Dynamic matrix rank with partial lookahead. In: Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008, 05.12.2008. |
Relação |
http://drops.dagstuhl.de/opus/volltexte/2008/1759/ http://eprints.iisc.ernet.in/40704/ |
Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
Tipo |
Conference Paper PeerReviewed |