Delta-rational chord: Difference between revisions

Inthar (talk | contribs)
Inthar (talk | contribs)
Line 51: Line 51:
Then, provided that the positive rational number <math>m/n</math> lies in the image <math>r_{\mathbf{u}, \mathbf{v}}(I),</math> we can solve for the frequency ratio <math>g \in I</math> that satisfies <math>r_{\mathbf{u}, \mathbf{v}}(g) = m/n,</math> making the specified chord ('''0''', '''u''', '''v''') a +''n''+''m'' DR chord.
Then, provided that the positive rational number <math>m/n</math> lies in the image <math>r_{\mathbf{u}, \mathbf{v}}(I),</math> we can solve for the frequency ratio <math>g \in I</math> that satisfies <math>r_{\mathbf{u}, \mathbf{v}}(g) = m/n,</math> making the specified chord ('''0''', '''u''', '''v''') a +''n''+''m'' DR chord.


The existence of an exact tuning for a delta signature specification is only guaranteed to hold when we only care about a ratio between ''two'' terms in the delta signature being exact. If we want to optimize an arbitrary specified delta signature (with some deltas possibly held free), we can use a least-squared-error solution instead to minimize the error.
The existence of an exact tuning for a delta signature specification is only guaranteed to hold when we only care about a ratio between ''two'' terms in the delta signature being exact. If we want to optimize an arbitrary specified delta signature (with some deltas possibly held free), we can use a least-squares-error solution instead to minimize the error.
 
=== Measuring the error of an approximation ===
=== Measuring the error of an approximation ===
==== Linear error ====
==== Linear error ====