Defactoring algorithms: Difference between revisions
Cmloegcmluin (talk | contribs) correct Pernet-Smith to Pernet-Stein |
Cmloegcmluin (talk | contribs) |
||
| Line 895: | Line 895: | ||
[[Dave Keenan]] and [[Douglas Blumeyer]] record a summary of their work here in case it may be helpful to anyone else who might want to iterate on this later. The other major failed experimental defactoring technique was [[Sum-and-difference_defactoring|SAD defactoring]]. | [[Dave Keenan]] and [[Douglas Blumeyer]] record a summary of their work here in case it may be helpful to anyone else who might want to iterate on this later. The other major failed experimental defactoring technique was [[Sum-and-difference_defactoring|SAD defactoring]]. | ||
===Addabilization defactoring=== | |||
This defactoring technique is used specifically in the process of preparing matrices for [[temperament arithmetic]]; it defactors while managing to change only a single row of the original matrix, a necessary constraint of that problem. But this method is not computationally efficient or easier to understand, so unless you have this specific need, it is not your best option. Details can be found here: [[Temperament arithmetic#Matrix approach]]. | |||
=References= | =References= | ||