Delta-rational chord: Difference between revisions
| Line 53: | Line 53: | ||
== Least-squares error measures == | == Least-squares error measures == | ||
Say we want the error of a chord 1:''r''<sub>1</sub>:''r''<sub>2</sub>:...:''r''<sub>''n''</sub> (in increasing order), with ''n'' > 1, in the linear domain as an approximation to a fully delta-rational chord with signature +δ<sub>1</sub> +δ<sub>2</sub> ... +δ<sub>''n''</sub> (where the delta signature is | Say we want the error of a chord 1:''r''<sub>1</sub>:''r''<sub>2</sub>:...:''r''<sub>''n''</sub> (in increasing order), with ''n'' > 1, in the linear domain as an approximation to a fully delta-rational chord with signature +δ<sub>1</sub> +δ<sub>2</sub> ... +δ<sub>''n''</sub> (where the delta signature is written based on the chord written to have root 1), i.e. a chord | ||
<math> | <math> 1 : 1 + \delta_1 : \cdots : 1 + \sum_{l=1}^n \delta_l </math> | ||
We can replace the 1 with x, vary x and ask, "By at least how much do the deltas have to be off for any x?" | |||
=== Naive least-squares error === | === Naive least-squares error === | ||