See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/240954906

On the Complexity of Matrix Inversion

Article · January 2003

CITATIONS READS
11 949

1 author:

Amund Tveit
Zedge
31 PUBLICATIONS   381 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Amund's Deep Learning Blog - https://amundtveit.com View project

DeepLearningKit - http://deeplearningkit.org View project

All content following this page was uploaded by Amund Tveit on 08 July 2016.

The user has requested enhancement of the downloaded file.

 On the Complexity of Matrix Inversion

Amund Tveit

Department of Computer and Information Science,

Norwegian University of Science and Technology,
N-7491 Trondheim, Norway
amund.tveit@idi.ntnu.no

Abstract. A lower bound of Omega(n2 log(n)) is proved for the time

complexity of calculating the inverse of a matrix nxn, over the real or
complex numbers in the sequential computation case.

Keywords: Computational Complexity, Matrix Inversion and Multiplication

Corollary 1. The lower bound for the computational time complexity I(n) for
the inversion of a matrix nxn is Ω(n2 logn), over the real or complex numbers
in the sequential computation case.

Proof. It has been shown a) that the theoretical speedups of matrix multiplica-
tion of two nxn matrices M (n) translate to speedups for matrix inversion, i.e.
I(n) = Θ(M (n)) [1], and vice versa. The lower bound of matrix multiplication
of two nxn matrices is Ω(n2 log(n)) [2]. The proof follows by deduction.

References
1. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to
Algorithms, chapter 31.5, pages 762–765. MIT Press, 1st edition, 1990.
2. Ran Raz. On the Complexity of Matrix Product. SIAM Journal on Computing,
32(5):1356–1369, 2003.

View publication stats