News for hackers. Stuff that matters.
Re:What Is a Schur Decomposition? by cat_man on Tuesday March 05, 2024 @12:42AM (#39599849)
You're right, I did mistakenly mix a few concepts together. The series representation for the function is infinite, like you say. What I was misapplying was the idea that a convergent infinite sum of matrix products (c0I + c1A + ... + cnA^n + ...) can be written as finite polynomial, which relies on Cayley-Hamilton like you say. So f(A) for any particular choice of A, can be written as a finite polynomial, but the coefficients of that polynomial will change as A does.

So writing

exp(A) = I + A + A^2/2 + ... + A^n/n!

like I did isn't correct. The concept I was thinking of was a Taylor series like this

exp(A) = I + A + A^2/2 + ... + A^n/n! + ... (to infinity)

has an equivalent finite polynomial like:

exp(A) = c0I + c1A + ... +c_{n-1}*A^(n-1)

(usually expressed as order n-1, not n like I was said earlier). The c0, c1, ... c_{n-1} will depend on A, so not as generally useful as what I was misremembering. It does let you build representations for things like exp(tA) (where t is a scalar multiple) in terms of a finite polynomial (the terms depending on t, like the "exp(lambda*t)" in your diagonal matrix example, end up in the c0, c1, ..., c_{n-1} coefficients).

Thanks for the correction and sorry if my garbled attempt at explaining confused anyone. The point about matrix functions being based on series representations is independent of those mistakes.

There are no comments on this comment yet.