DeepAI AI Chat
Log In Sign Up

Faster Sparse Matrix Inversion and Rank Computation in Finite Fields

by   Sílvia Casacuberta, et al.

We improve the current best running time value to invert sparse matrices over finite fields, lowering it to an expected O(n^2.2131) time for the current values of fast rectangular matrix multiplication. We achieve the same running time for the computation of the rank and nullspace of a sparse matrix over a finite field. This improvement relies on two key techniques. First, we adopt the decomposition of an arbitrary matrix into block Krylov and Hankel matrices from Eberly et al. (ISSAC 2007). Second, we show how to recover the explicit inverse of a block Hankel matrix using low displacement rank techniques for structured matrices and fast rectangular matrix multiplication algorithms. We generalize our inversion method to block structured matrices with other displacement operators and strengthen the best known upper bounds for explicit inversion of block Toeplitz-like and block Hankel-like matrices, as well as for explicit inversion of block Vandermonde-like matrices with structured blocks. As a further application, we improve the complexity of several algorithms in topological data analysis and in finite group theory.


page 1

page 2

page 3

page 4


On matrices with displacement structure: generalized operators and faster algorithms

For matrices with displacement structure, basic operations like multipli...

Multiresolution kernel matrix algebra

We propose a sparse arithmetic for kernel matrices, enabling efficient s...

SPIN: A Fast and Scalable Matrix Inversion Method in Apache Spark

The growth of big data in domains such as Earth Sciences, Social Network...

RePAST: A ReRAM-based PIM Accelerator for Second-order Training of DNN

The second-order training methods can converge much faster than first-or...

Graph-Induced Rank Structures and their Representations

A new framework is proposed to study rank-structured matrices arising fr...

On Fast Matrix Inversion via Fast Matrix Multiplication

Volker Strassen first suggested an algorithm to multiply matrices with w...

Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication

We describe a matrix multiplication recognition algorithm for a subset o...