MHB Inverse of Giant $7 \times 7$ Matrix: Tips & Tricks

  • Thread starter Thread starter A.Magnus
  • Start date Start date
  • Tags Tags
    Inverse
Click For Summary
SUMMARY

The discussion centers on finding the inverse of a $7 \times 7$ orthogonal matrix, denoted as matrix $A$. Participants confirm that the inverse of an orthogonal matrix is its transpose, simplifying the process significantly. The Gauss-Jordan method is mentioned but deemed unnecessary for this specific case. The user, MaryAnn, ultimately discovers that the least tedious solution involves expanding the diagonal entries of the identity matrix to identify non-zero elements in the inverse.

PREREQUISITES
  • Understanding of matrix operations, specifically matrix multiplication
  • Knowledge of orthogonal matrices and their properties
  • Familiarity with the concept of matrix transposition
  • Basic understanding of the Gauss-Jordan elimination method
NEXT STEPS
  • Study the properties of orthogonal matrices in linear algebra
  • Learn how to compute the transpose of a matrix
  • Explore the Gauss-Jordan elimination method for finding inverses
  • Practice solving for the inverse of larger matrices using various methods
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, as well as anyone involved in computational mathematics or matrix theory.

A.Magnus
Messages
138
Reaction score
0
How do I go about find out the inverse of this giant $7 \times 7$ matrix? Do I need to evaluate it using the tedious Gauss-Jordan method? Any property, short-cut, trick that I can take advantage of?

$$\begin{pmatrix}
0 &1 &0 &0 &0 &0 &0\\
0 &0 &0 &1 &0 &0 &0\\
0 &0 &0 &0 &0 &0 &1\\
0 &0 &0 &0 &0 &1 &0\\
0 &0 &1 &0 &0 &0 &0\\
0 &0 &0 &0 &1 &0 &0\\
1 &0 &0 &0 &0 &0 &0\\
\end{pmatrix}$$

Your time and gracious help is very much appreciated? Thank you. ~MA
 
Physics news on Phys.org
Lets call the matrix you gave $A$. What is the transpose of $A$? That's your answer but I'm not immediately sure how to prove that.
 
Are you supposed to be finding a shortcut or fast method? It would seem unlikely that finding the inverse of a matrix of this size would be a homework task to be done by hand?
 
Hey MaryAnn! ;)

Are you familiar, or do your notes say something about an Orthogonal matrix?
 
I like Serena said:
Hey MaryAnn! ;)

Are you familiar, or do your notes say something about an Orthogonal matrix?

No, we don't have it. I checked textbook's index but could not find any orthogonal matrix entry. But anyway, I found out the least tedious solution: Assuming the matrix is $X$ and its inverse is $Y$, then $XY = I$. Then using the definition of multiplication of matrix, I expanded the seven entries of the diagonal of $I$ (since they are all non-zero) to come up with the $y_{ij}$ that are non-zero. The rest of $y_{ij}$ are zero. Thank you though for pitching in, thanks for your gracious help and time. ~MA

- - - Updated - - -

greg1313 said:
Lets call the matrix you gave $A$. What is the transpose of $A$? That's your answer but I'm not immediately sure how to prove that.

I did that, but its transpose did not take me anywhere. Thank you though for your gracious help, and time. ~MA

- - - Updated - - -

Joppy said:
Are you supposed to be finding a shortcut or fast method? It would seem unlikely that finding the inverse of a matrix of this size would be a homework task to be done by hand?

I think I found the least tedious solution, see my response to I Like Serena. Thank you though for your gracious help, and for your time. ~MA
 
MaryAnn said:
No, we don't have it. I checked textbook's index but could not find any orthogonal matrix entry. But anyway, I found out the least tedious solution: Assuming the matrix is $X$ and its inverse is $Y$, then $XY = I$. Then using the definition of multiplication of matrix, I expanded the seven entries of the diagonal of $I$ (since they are all non-zero) to come up with the $y_{ij}$ that are non-zero. The rest of $y_{ij}$ are zero. Thank you though for pitching in, thanks for your gracious help and time. ~MA

That works as well.
For the record, your matrix is orthogonal because each column vector has unit length, and because each pair of column vectors is orthogonal.
As a consequence the inverse is simply the transpose as greg1313 mentioned. (Mmm)
 
It doesn't look to me like "Gauss-Jordan" will be all that tedious. You should be able to do some obvious "swaps" of two rows to get the matrix to the identity matrix,
 
I like Serena said:
That works as well.
For the record, your matrix is orthogonal because each column vector has unit length, and because each pair of column vectors is orthogonal.
As a consequence the inverse is simply the transpose as greg1313 mentioned. (Mmm)

Thank you again for your gracious help. ~MA

- - - Updated - - -

HallsofIvy said:
It doesn't look to me like "Gauss-Jordan" will be all that tedious. You should be able to do some obvious "swaps" of two rows to get the matrix to the identity matrix,

Thank you for your gracious comment. ~MA
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 34 ·
2
Replies
34
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K