Complexity of a particular method for matrix inversion

Complexity of a particular method for matrix inversion

0.00 Avg rating0 Votes
Article ID: iaor19941065
Country: France
Volume: 26
Issue: 2
Start Page Number: 177
End Page Number: 182
Publication Date: Apr 1992
Journal: RAIRO Operations Research
Authors:
Abstract:

The paper shows that the direct method which consists of iteratively inverting sub-matrices of increasing size, has same o(n3) computational complexity as Gauss or Jordan methods.

Reviews

Required fields are marked *. Your email address will not be published.