Optimization: Difference between revisions

Include a short discussion on these various norms
Improve the formulation
 
(One intermediate revision by the same user not shown)
Line 18: Line 18:
The weight, represented by a diagonal transformation matrix, determines the importance of each formal prime. Since the tuning space and the interval space are {{w|dual (mathematics)|dual}} to each other, rating of importance in the tuning space is equivalent to rating of complexity in the interval space. The Tenney weight is the most common weight:  
The weight, represented by a diagonal transformation matrix, determines the importance of each formal prime. Since the tuning space and the interval space are {{w|dual (mathematics)|dual}} to each other, rating of importance in the tuning space is equivalent to rating of complexity in the interval space. The Tenney weight is the most common weight:  


<math>\displaystyle W = \operatorname {diag} (1/\log_2 (Q)) </math>
$$ W = \operatorname {diag} (1/\log_2 (Q)) $$


which indicates that the prime harmonic ''q'' in ''Q'' = {{val| 2 3 5 … }} has the importance of 1/log<sub>2</sub>(''q''). Its dual states that ''q'' has the complexity of log<sub>2</sub>(''q'').  
which indicates that the prime harmonic ''q'' in ''Q'' = {{val| 2 3 5 … }} has the importance of 1/log<sub>2</sub>(''q''). Its dual states that ''q'' has the complexity of log<sub>2</sub>(''q'').  
Line 49: Line 49:


== General formulation ==
== General formulation ==
In general, the temperament optimization problem (except for the destretch) can be defined as follows. Given a temperament mapping ''V'' and the [[just tuning map]] ''J'', we specify a weight–skew transformation, represented by transformation matrix ''X'', and a ''q''-norm. An optional unit eigenmonzo list ''M''<sub>''I''</sub> can be added. The goal is to find the generator list ''G'' by
In general, the temperament optimization problem (except for the destretch) can be defined as follows. Given a temperament mapping matrix ''V'' and the [[just tuning map]] ''J'', we specify a weight–skew transformation matrix ''X'', a ''q''-norm, and optionally a unit eigenmonzo list ''M''. Let ''G'' denote the generator tuning map, we want to


Minimize
$$
 
\begin{align}
<math>\displaystyle \lVert GV_X - J_X \rVert_q </math>
& \text{find} && G \\
 
& \text{that minimizes} && \lVert GV_X - J_X \rVert_q \\
subject to
& \text{subject to} && (GV - J)M = O
 
\end{align}
<math>\displaystyle (GV - J)M_I = O </math>
$$


where (·)<sub>''X''</sub> denotes the variable in the weight–skew transformed space, found by
where (·)<sub>''X''</sub> denotes the variable in the weight–skew transformed space, found by


<math>\displaystyle
$$
\begin{align}
\begin{align}
V_X &= VX \\
V_X &= VX \\
J_X &= JX
J_X &= JX
\end{align}
\end{align}
</math>
$$


== Common tunings ==
== Common tunings ==
Line 93: Line 93:
== External links ==
== External links ==
* [http://x31eq.com/temper/primerr.pdf|''Prime Based Error and Complexity Measures''] ("primerr.pdf") by [[Graham Breed]]
* [http://x31eq.com/temper/primerr.pdf|''Prime Based Error and Complexity Measures''] ("primerr.pdf") by [[Graham Breed]]
== Notes ==


[[Category:Math]]
[[Category:Math]]
[[Category:Regular temperament tuning]]
[[Category:Regular temperament tuning]]