Optimal ET sequence: Difference between revisions

Cmloegcmluin (talk | contribs)
"optimal GPV sequence" → "optimal ET sequence", per recent discussion to subsume GP/uniform property into "optimal" (along with support property and error-decreasing property); as well as sequence being of ETs, not vals/maps
Update to reflect how you're supposed to use this script since v1.14.0
 
(2 intermediate revisions by the same user not shown)
Line 2: Line 2:


== Computation ==
== Computation ==
Optimal ET sequences can be computed using [[Flora Canou]]'s [https://github.com/FloraCanou/temperament_evaluator Temperament Evaluator], using the <code>et_sequence</code> function. For example, here is how the optimal ET sequence for [[No-threes subgroup temperaments #Yer_.28rank_3.29|Yer temperament]] was determined, by providing its comma basis and subgroup:
Optimal ET sequences can be computed by iterating through all GPVs, finding the error of each and comparing it with the last best error value.
 
Below is an example using [[Flora Canou]]'s [https://github.com/FloraCanou/temperament_evaluator Temperament Evaluator], using the <code>et_sequence</code> function from <code>te_equal.py</code>. Here is how the optimal ET sequence for [[No-threes subgroup temperaments #Yer_.28rank_3.29|Yer temperament]] was determined, by providing its comma basis and subgroup:


<syntaxhighlight lang="python">
<syntaxhighlight lang="python">
import et_sequence as ete
import numpy as np
import numpy as np
from lib.te_common import Subgroup
from lib.te_equal import et_sequence


ete.et_sequence(np.array([[7, -4], [-1, 1], [-1, -1], [-1, 0], [1, 1]]), subgroup=[2, 11, 13, 17, 19])
et_sequence(np.column_stack([[7, -1, -1, -1, 1], [-4, 1, -1, 0, 1]]), subgroup=Subgroup ([2, 11, 13, 17, 19]))
</syntaxhighlight>
</syntaxhighlight>


Which produces the list: 13, 24, 33, 37, 46, 57, 70, 127.
Which produces the list: 11, 13, 24, 33, 37, 46, 57, 70, 127, 197eh.


[[Category:Regular temperament theory]]
[[Category:Regular temperament theory]]