Defactoring algorithms: Difference between revisions

Line 151:

It should also be noted that toward the very beginning of Dave and Douglas's effort to develop a defactoring algorithm, Thomas McMurray Price described — in a message sent to the Xenharmonic Alliance Discord server — an algorithm almost identical to the Pernet-Stein algorithm, while also still being unaware of the Pernet-Stein paper. At this time, Dave and Douglas could not understand Tom's math well enough to realize that he'd just dropped the solution in their laps. Again, it wasn't until column Hermite defactoring was published that Tom commented on the findings and brought his ideas back into the conversation that Dave and Douglas realized the close connection between his ideas, Pernet-Stein defactoring, and column Hermite defactoring.

Here is the implementation of Pernet-Stein defactoring:

<nowiki>pernetSteinDefactor[m_] := Inverse[Transpose[Take[hnf[Transpose[m]], MatrixRank[m]]]].m;</nowiki>

== New development: column Hermite defactoring ==

@@ Line 151: / Line 151: @@
 It should also be noted that toward the very beginning of Dave and Douglas's effort to develop a defactoring algorithm, Thomas McMurray Price described — in a message sent to the Xenharmonic Alliance Discord server — an algorithm almost identical to the Pernet-Stein algorithm, while also still being unaware of the Pernet-Stein paper. At this time, Dave and Douglas could not understand Tom's math well enough to realize that he'd just dropped the solution in their laps. Again, it wasn't until column Hermite defactoring was published that Tom commented on the findings and brought his ideas back into the conversation that Dave and Douglas realized the close connection between his ideas, Pernet-Stein defactoring, and column Hermite defactoring.
+Here is the implementation of Pernet-Stein defactoring:
+ <nowiki>pernetSteinDefactor[m_] := Inverse[Transpose[Take[hnf[Transpose[m]], MatrixRank[m]]]].m;</nowiki>
 == New development: column Hermite defactoring ==