User:FloraC/Hard problems of harmony and psychoacoustically supported optimization: Difference between revisions

Style and misc., bump the version number for all the small changes
According to Mike, "Hahn" is skewed in the first place, so I'm claiming the unskewed variant myself
Line 191: Line 191:


== Chapter V. Towards an Optimization Strategy ==
== Chapter V. Towards an Optimization Strategy ==
Incorporating all that have been discussed above, I recommend CTE tuning as the best general-purpose reference solution to everyone, whereas my hemi-idiosyncratic answer to tuning optimization is the '''CH<sub>''n''</sub>E tuning''' (for '''constrained Hahn[''n'']-Euclidean tuning''').  
Incorporating all that have been discussed above, I recommend CTE tuning as the best general-purpose reference solution to everyone, whereas my hemi-idiosyncratic answer to tuning optimization is based on a meticulously engineered weight function, which happens to be an unskewed version of the Hahn distance. Let us dub this the Canou[''n''] weight, and the tuning using this weight the '''CC<sub>''n''</sub>E tuning''' (for '''constrained Canou[''n'']-Euclidean tuning''').  


The only part that needs explanation is the Hahn[''n''] weight, an adaptation to the original Hahn distance.
In this weight, the ''n'' is a positive integer determining the highest relevant harmonic. The weight of any prime harmonic equals its maximum number of stacks without exceeding the ''n''-integer-limit. Different values of ''n'' can alter the relative weights of the primes.  
 
The ''n'' is a positive integer determining the highest relevant harmonic. Specifically, the weight of any prime harmonic equals its maximum number of stacks without exceeding the ''n''-integer-limit, so different values of ''n'' can alter the relative weights of the primes.  


To illustrate, let us set ''n'' = 9, or 9-integer-limit. Harmonic 2 can be stacked thrice, giving 8. Stacking it four times would give 16, exceeding 9. Its weight is thus 3. Harmonic 3 can be stacked twice, giving 9. Stacking it three times would give 27, exceeding 9. Its weight is thus 2. Both 5 and 7 have unit weight since they can only be stacked once in the integer limit. 11 and beyond have zero weight because they cannot be stacked at all. If optimization is to be carried out for a 13-limit temperament then we have the weights 3, 2, 1, 1, 0, 0 for primes 2 to 13. The weights are different if ''n'' = 7, or 7-integer-limit, for example. The weight of 2 is 2, of 3, 5 and 7 is unity, and of 11 and 13 zero, giving 2, 1, 1, 1, 0, 0 for primes 2 to 13.  
To illustrate, let us set ''n'' = 9, or 9-integer-limit. Harmonic 2 can be stacked thrice, giving 8. Stacking it four times would give 16, exceeding 9. Its weight is thus 3. Harmonic 3 can be stacked twice, giving 9. Stacking it three times would give 27, exceeding 9. Its weight is thus 2. Both 5 and 7 have unit weight since they can only be stacked once in the integer limit. 11 and beyond have zero weight because they cannot be stacked at all. If optimization is to be carried out for a 13-limit temperament then we have the weights 3, 2, 1, 1, 0, 0 for primes 2 to 13. The weights are different if ''n'' = 7, or 7-integer-limit, for example. The weight of 2 is 2, of 3, 5 and 7 is unity, and of 11 and 13 zero, giving 2, 1, 1, 1, 0, 0 for primes 2 to 13.  


The Hahn[''n''] weight matrix is given as
The Canou[''n''] weight matrix is given as


$$
$$
Line 207: Line 205:
which indicates that the prime ''q'' in ''Q'' has the weight equal to floor (log<sub>''q''</sub> (''n'')).  
which indicates that the prime ''q'' in ''Q'' has the weight equal to floor (log<sub>''q''</sub> (''n'')).  


The Tenney weight is a special case of the Hahn[''n''] weight, where ''n'' → infinity. The only thing that sets Hahn[''n''] apart from Tenney is the floor function (since log<sub>''Q''</sub> (''n'') = log<sub>2</sub> (''n'')/log<sub>2</sub> (''Q'') and log<sub>2</sub> (''n'') is a constant), and its effect converges to zero as ''n'' gets sufficiently large. Conceptualizing the Tenney weight in this way is not recommended, though, because Tenney's is characteristically transcendental whereas all the other Hahn[''n''] weights are algebraic.  
The Tenney weight is a special case of the Canou[''n''] weight, where ''n'' → infinity. The only thing that sets Canou[''n''] apart from Tenney is the floor function (since log<sub>''Q''</sub> (''n'') = log<sub>2</sub> (''n'')/log<sub>2</sub> (''Q'') and log<sub>2</sub> (''n'') is a constant), and its effect converges to zero as ''n'' gets sufficiently large. Conceptualizing the Tenney weight in this way is not recommended, though, because Tenney's is characteristically transcendental whereas all the other Canou[''n''] weights are algebraic.  


That defines the H<sub>''n''</sub>C, H<sub>''n''</sub>E, and H<sub>''n''</sub>OP tunings, but if we contrain the octave to pure, it does not matter how many times the octave is stacked, making the integer limit equivalent to the smaller closest odd limit. The proposed convention is to always use the largest number ''n'' if multiple consecutive choices of ''n'' will give the same CH<sub>''n''</sub>E tuning. For example, CH<sub>13</sub>E, CH<sub>14</sub>E, CH<sub>15</sub>E, and CH<sub>16</sub>E are all equivalent and one should always write CH<sub>16</sub>E.  
That defines the C<sub>''n''</sub>C, C<sub>''n''</sub>E, and C<sub>''n''</sub>OP tunings, but if we contrain the octave to pure, it does not matter how many times the octave is stacked, making the integer limit equivalent to the smaller closest odd limit. The proposed convention is to always use the largest number ''n'' if multiple consecutive choices of ''n'' will give the same CC<sub>''n''</sub>E tuning. For example, CC<sub>13</sub>E, CC<sub>14</sub>E, CC<sub>15</sub>E, and CC<sub>16</sub>E are all equivalent and one should always write CC<sub>16</sub>E.  


Specifically designed to ''my'' taste, another special case of note is setting ''n'' = 24, or Hahn[24]. The entries are 4, 2, 1, 1, 1, 1, 1, 1, 1 for primes 2 to 23, and primes beyond 23 are never optimized for. The octave matters not, so you can see its only difference from the equilateral weight is that not 3 but 9 is treated as a prime, meaning every two steps along the path of 3 counts as one.  
Specifically designed to ''my'' taste, another special case of note is setting ''n'' = 24, or Canou[24]. This shall be the default ''n''. The entries are 4, 2, 1, 1, 1, 1, 1, 1, 1 for primes 2 to 23, and primes beyond 23 are never optimized for. The octave matters not, so you can see its only difference from the equilateral weight is that not 3 but 9 is treated as a prime, meaning every two steps along the path of 3 counts as one.  


Let us tune some temperaments!  
Let us tune some temperaments!  
Line 218: Line 216:
{| class="wikitable"
{| class="wikitable"
|-
|-
! Temperament !! Error Map (CTE) !! Error Map (CH<sub>24</sub>E)
! Temperament !! Error Map (CTE) !! Error Map (CC<sub>24</sub>E)
|-
|-
| Meantone, 5-limit || {{val| 0 −4.7407 +2.5436 }} || {{val| 0 −4.3013 +4.3013 }}
| Meantone, 5-limit || {{val| 0 −4.7407 +2.5436 }} || {{val| 0 −4.3013 +4.3013 }}
Line 240: Line 238:


== Release Notes ==
== Release Notes ==
© 2023 Flora Canou
© 2023–2024 Flora Canou


Version Stable 3
Version Stable 4


This work is licensed under the [https://creativecommons.org/licenses/by-sa/4.0/ Creative Commons Attribution-ShareAlike 4.0 International License].
This work is licensed under the [https://creativecommons.org/licenses/by-sa/4.0/ Creative Commons Attribution-ShareAlike 4.0 International License].