gusl: (Default)
[personal profile] gusl
Given a square matrix B, how does one test whether the sequence defined by B^p converges to the zero matrix, as p->infty?

(no subject)

Date: 2007-11-12 01:21 am (UTC)
From: [identity profile] rdore.livejournal.com
So, if B is diagonalizable (over the complex numbers), then Bp -> 0 is equivalent to all the eigenvalues being norm less than one.

If B isn't diagonalizable, you'd have to look at the Jordan normal form. I think if all the eigenvalues are norm less than 1, it still goes to zero. But I'm having trouble working out the details in my head, and I'm too lazy right now to actually get a piece of paper and do the calculation out.

(no subject)

Date: 2007-11-12 09:52 pm (UTC)
From: [identity profile] rdore.livejournal.com
Consider a Jordan block with eigenvalue lambda, where norm(lambda) < 1.

If lambda = 0, then powers of the block will keep becoming more upper triangular with each power, so after n steps it will just be 0.

If lambda != 0, the entries k places above the diagonal will never be more
((k+1)/lambda) times bigger than the entries just below them. (This can be proven by induction on k.) This means that no entry will ever be more than (n!)/(lambda^n) times as big as the diagonal. Since this is a constant, and the diagonal goes to zero, all entries will go to zero.
Edited Date: 2007-11-12 09:53 pm (UTC)

February 2020

S M T W T F S
      1
2345678
9101112131415
16171819202122
23242526272829

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags