Defactoring: Difference between revisions
Cmloegcmluin (talk | contribs) |
Cmloegcmluin (talk | contribs) |
||
| Line 128: | Line 128: | ||
So this implementation begins by transposing the matrix, so that when it then performs the Hermite Decomposition, it is doing a column decomposition. We then take the unimodular matrix from the decomposition using <code>First[]</code>, and <code>Transpose[]</code> it to in effect undo the transposition we did at the beginning. | So this implementation begins by transposing the matrix, so that when it then performs the Hermite Decomposition, it is doing a column decomposition. We then take the unimodular matrix from the decomposition using <code>First[]</code>, and <code>Transpose[]</code> it to in effect undo the transposition we did at the beginning. | ||
### refer to the email thread with Dave and talk about how it leaves the enfactoring behind while preserving the important information in the unimodular matrix, then does an inverse | |||
==== by hand ==== | |||
In an effort to demystify the effects of column Hermite defactoring, we will here walk though an example manually. It's a silly example, but suppose we have the mapping {{vector|{{map|6 5 4}} {{map|4 -4 1}}}}. Spoiler alert: it is 11-enfactored. | |||
### include the L-shape work-through example | ### include the L-shape work-through example | ||
=== other stuff to report === | === other stuff to report === | ||