Site Meter Abstract of "On the Complexity of Matrix Inversion"
 

Home
Publications
Resume
Blog
InternetPercent
Amund@Twitter
Google
Web amundtveit.info

"On the Complexity of Matrix Inversion"

Authors: Amund Tveit

Abstract:
A lower bound of Omega(n^2 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

Known Citations:

  1. Jean-Philippe Aumasson. "Time complexities of common arithmetic algorithms", 2006

  2. Thomas Steffen. "Control Reconfiguration of Dynamical Systems - Linear Approaches and Structural Tests", Lecture Notes in Control and Information Sciences (LNCIS), Springer-Verlag, The Netherlands, 2005

  3. Michael T. M. Emmerich. "Single- and Multi-objective Evolutionary Design Optimization Assisted by Gaussian Random Field Metamodels", Doctorate Thesis, Faculty of Informatics, University of Dortmund, Germany, October 2005


Follow @atbrox