Constrained tuning: Difference between revisions

m Fix the link
→Definition: make it match the optimization page
Line 6: Line 6:


== Definition ==
== Definition ==
Given a temperament [[mapping]] A and the [[JIP]] J<sub>0</sub>, denote the weight-skewed mapping V = AWX and the weight-skewed JIP J = J<sub>0</sub>WX. Suppose the tuning is constrained by the eigenmonzo list B<sub>C</sub>. The goal is to find the generator list G by
Given a temperament [[mapping]] A and the [[JIP]] J<sub>0</sub>, we specify a weight W, a skew X, and a ''p''-norm. Suppose the tuning is constrained by the eigenmonzo list B<sub>C</sub>. The goal is to find the generator list G by


Minimize
Minimize
Line 16: Line 16:
<math>\displaystyle (GA - J_0)B_{\rm C} = O </math>
<math>\displaystyle (GA - J_0)B_{\rm C} = O </math>


where O is the zero matrix.
where V is the weight-skewed mapping and J the weight-skewed JIP, found by
 
<math>\displaystyle
\begin{align}
V &= AWX \\
J &= J_0 WX
\end{align}
</math>


The problem is feasible if
The problem is feasible if