Computational cost of calculating an inverse via Gauss-Jordan

Click For Summary
SUMMARY

The computational cost of finding the inverse of an nxn matrix via Gauss-Jordan elimination is determined by the number of multiplications and additions required during the process. The total number of multiplications is calculated as n³ + n², while the total number of additions is n³ - 2n² + n. This analysis is based on systematically eliminating entries below and above the diagonal in the augmented matrix A|I, and then normalizing each row. The calculations provided are accurate and reflect the standard approach to this problem.

PREREQUISITES
  • Understanding of Gauss-Jordan elimination
  • Familiarity with matrix operations
  • Basic knowledge of computational complexity
  • Ability to perform algebraic manipulations
NEXT STEPS
  • Study the computational complexity of matrix operations in linear algebra
  • Learn about alternative methods for matrix inversion, such as LU decomposition
  • Explore the implications of matrix size on computational cost
  • Investigate numerical stability in matrix inversion techniques
USEFUL FOR

Students studying linear algebra, mathematicians, computer scientists, and anyone involved in numerical methods or computational mathematics.

Fractal20
Messages
71
Reaction score
1

Homework Statement


Find the computational cost for finding the inverse of an nxn matrix via Gauss-Jordan elimination. That is setting up A|I and converting it to I|A-1.

Homework Equations


The Attempt at a Solution


So I can't see where I went wrong, but my answer does not agree with my fellow students.

Consider the ith step in the process. We need to first eliminate the entries in rows below the ith diagonal entry and then use this diagonal element to eliminate the entries above the ith diagonal. Consider eliminating the entries below first.

We have (n-i) rows and for each row we must calculate the constant by which to multiply by. Then we must multiply the remaining n-i elements in that row plus the (i-1) entries on the augmented side (it is i-1 since the entries are 0 on the augmented side to the right of the diagonal and the ith diagonal entry is a 1 and thus we need not calculate the constant to multiple again). Altogether that is (n-i+i-1+1)=n multiplications for each on the (n-i) rows. Also, for each row there are (n-i-1) additions plus i additions on the augmented side for a total of (n-i-1+i)=(n-1) additions for each of the (n-i) rows.

For eliminating the entries above the ith diagonal for each of the (i-1) rows we must compute the constant to multiply by, and the product with the (n-i+i-1) remaining entries (again i;m not including the ith diagonal entry in the augmented matrix since it is a 1). Thus we get (i-1)n multiplications and (i-1)(n-1) additions.

After going through i:1->n we only need to divide each row by the diagonal entry to get the identity. We must calculate the constant to multiple and then multiply the n entries on the augmented side for a total of (n+1)n multiplications.

Thus the multiplications are
=(n+1)n + [itex]\sum[/itex]i=1n (n-i)n + (i-1)n
=n2 + [itex]\sum[/itex]i=1n n2 -1
=n3+n2 multiplications

and the additions are
=[itex]\sum[/itex]i=1n (n-i)(n-1) + (i-1)(n-1)
=n3 - 2n2+n

Is this incorrect? If so, can you give me a hint as to where I went astray? Thanks
 
Physics news on Phys.org
Anybody?
 
  • Like
Likes   Reactions: Autar Kaw

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
14K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 22 ·
Replies
22
Views
3K