Timeline for Exploring Matrix Powers with Wolfram (using Sum Notation)
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2021 at 20:12 | vote | accept | George | ||
| S Feb 14, 2021 at 20:11 | history | bounty ended | George | ||
| S Feb 14, 2021 at 20:11 | history | notice removed | George | ||
| Feb 7, 2021 at 13:51 | answer | added | bill s | timeline score: 2 | |
| Feb 7, 2021 at 12:19 | answer | added | Ben Izd | timeline score: 4 | |
| Feb 7, 2021 at 11:57 | comment | added | yarchik | Well, for 2 by 2 matrices that is easy because they can be analytically diagonalized. Even more insight can be gained by expanding in terms of the Pauli matrices | |
| S Feb 7, 2021 at 5:18 | history | bounty started | George | ||
| S Feb 7, 2021 at 5:18 | history | notice added | George | Draw attention | |
| Feb 7, 2021 at 0:41 | comment | added | George |
Running FindSequenceFunction on the top-left matrix element (i.e. Table[ First@First@Expand@MatrixPower[m, k], {k, 0, 10}] // FindSequenceFunction) just hangs on my machine. I'm assuming it doesn't turn up anything on more powerful machines.
|
|
| Feb 5, 2021 at 5:15 | comment | added | J. M.'s missing motivation♦ |
You could try using FindSequenceFunction[] on the matrix entries to find a general formula, but I'm usually pessimistic about finding general formulae for things of this sort, unless the matrix has some sort of structure (e.g. triangular, Hermitian, etc.).
|
|
| Feb 5, 2021 at 5:07 | history | asked | George | CC BY-SA 4.0 |