"On the Complexity of Matrix Inversion"
Authors: Amund Tveit
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
- Jean-Philippe Aumasson. "Time complexities of common arithmetic algorithms", 2006
- 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
- 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