Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with matrix-equations
Search options not deleted
user 2530
Equations whose unknown is a matrix, such as, for instance, algebraic Riccati equations $XAX+XB+CX+D=0$ or matrix differential equations (e.g. $\dot X(t)=AX(t)$. This tag is *not* meant for general systems of linear equations $Ax=b$.
14
votes
Cayley-Hamilton revisited
Am I missing something or is Ilya Bogdanov's elimination of $A_0$ trick more or less a proof in itself?
Assume that $f\left(B\right) = 0_n$. Then, $0_n = f\left(B\right) = A_kB^k + A_{k-1}B^{k-1} + . …
- 33.8k