Recent content by MathIdiot

Ok, I hope you can clarify a few things from your last statement. Those assumptions sound fine. However what is the euclidean algorithm? Also, what is meant by "T satisfies (X-c)^r"? Lastly how do you get cID? What I mean really is, how does one achieve this diagonalizable matrix?

Oh, ok (sorry). They are square, they don't have any other specialized format.

I'm not sure what you mean. The only ideas about "normal" I know is normalizing a vector. Normalizing a basis of vectors as well as normalizing a basis of orthogonal vectors to get an orthonormal basis. And orthogonal matrices. Is this at all what your implying?

[b]1. write the given matrix A as the sum of a diagonalizable matrix and a nilpotent matrix. A = 7, 3, 3, 2 0, 1, 2,-4 -8,-4,-5,0 2, 1, 1, 3 Homework Equations [b]3. The eigenvalues are 1, -1, 3 and the associated eigenvalues are (1,-2,0,0) (0,1,-1,0) (1,-2,0,1)...

How do you write a matrix as a sum of a diagonalizable matrix and a nilpotent matrix? It would be great if you could describe the steps in Layman's terms because I am not so hot in Linear Algebra. Thanks

[b]1. Let T be the linear operator on R^n that has the given matrix A relative to the standard basis. Find the spectral decomposition of T. A= 7, 3, 3, 2 0, 1, 2,-4 -8,-4,-5,0 2, 1, 2, 3 [b]3. eigen values are 1 (mulitplicity 1), -1 (mult. 1), 3 (mult. 2). And associated eigen...