Calculating Eigenvalue for 3D Matrix

  • Thread starter Thread starter gaffareee
  • Start date Start date
  • Tags Tags
    3d Eigenvalue
gaffareee
Messages
6
Reaction score
0
Dear frnds,

suppose one have a 3D matrix,

A=ones(3,3,3);

he wants to have eigen value of A,
then,

A-Lamda*I=0 where A is 3D matrix, I is 3D matrix.
now

Problem is our mathematical soft can only do 2D inversion or eigen calculation.
Please refer me any info to find out the eigenvalue of 3d matrix.

thanks anyway.
 
Physics news on Phys.org
I'm sorry, what do you mean by "ones(3,3,3)"? if there were only two "3"s I would interpret that as
\begin{bmatrix}1 & 1 & 1 \\ 1 & 1 & 1\\ 1 & 1 & 1\end{bmatrix}
the 3 by 3 matrix consisting of all "1"s.

Do you only know how to use software to find eigenvalues? What about determinants? I think you have found a problem with relying on software! Do you know the definition of "eigenvalue"?

One of the things you need to know is that A- \lambda I does NOT have to be the 0 vector, although, if you really meant "ones(3,3)", that does happen. A number, \lambda, is an eigenvalue if and only if there exist a non-zero vector v such that (A- \lambda I)v= 0.

To find the eigenvalues of a 3 by 3 matrix, use the fact that if (A- \lambda)v= 0 for a non-zero vector, then the matrix A- \lambda I, which is just A with the variable \lambda subtracted from each of its diagonal elements), while it is not necessarily 0, cannot have an inverse and so its determinant must be 0.

For the matrix above, that means you need to solve
\left|\begin{array}{ccc}1-\lambda & 1 & 1 \\ 1 & 1-\lambda & 1 \\ 1 & 1 & 1-\lambda\end{array}\right|= 0
That will give a cubic equation in \lambda which might have up to three different roots. Since it should be clear that the determinant of A itself if 0, one of those roots should be obvious.
 
Last edited by a moderator:
thanks for your kind reply.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top