Question

Is there a quicker way to find the eigenvector instead of using row reducing echelon if it is a triangular matrix: [0 -3 -7 -11; 0 0.5 -3 -8 ; 0 0 1 -4; 0 0 0 -1]?

Answer 1

i like your name

Answer 2

the eigenvalues are the diagonal entries, since it is a triangular matrix, so 0, 0.5, 1, -1; you will have to solve the eigenvectors the normal way, no tricks there

Answer 3

That's a better answer okay thanks!

Answer 4

your welcome