Timeline for Showing block diagonal structure of matrix by reordering
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 18, 2011 at 10:41 | comment | added | Szabolcs Horvát | Oops, good you pointed that out | |
| Jun 18, 2011 at 10:29 | history | edited | Roland Bacher | CC BY-SA 3.0 |
added 436 characters in body
|
| Jun 18, 2011 at 10:23 | history | edited | Roland Bacher | CC BY-SA 3.0 |
added 255 characters in body
|
| Jun 18, 2011 at 10:21 | comment | added | Roland Bacher | Yes, except that I forgot to take into account nilpotency properties, now fixed. | |
| Jun 18, 2011 at 9:25 | comment | added | Szabolcs Horvát | In essence, this also corresponds to interpreting the matrix as a graph, then starting from a node, visiting all nodes that can be visited, thus finding the largest connected component containing the starting node. Is this correct? | |
| Jun 17, 2011 at 18:45 | history | edited | Roland Bacher | CC BY-SA 3.0 |
added 67 characters in body
|
| Jun 17, 2011 at 18:06 | history | edited | Roland Bacher | CC BY-SA 3.0 |
added 3 characters in body; added 1 characters in body
|
| Jun 17, 2011 at 17:30 | history | edited | gowers | CC BY-SA 3.0 |
Corrected spelling of "mentioned"
|
| Jun 17, 2011 at 14:37 | history | answered | Roland Bacher | CC BY-SA 3.0 |