Error measures for DR chords: Difference between revisions
ArrowHead294 (talk | contribs) |
|||
| Line 5: | Line 5: | ||
The idea motivating least-squares error measures on a chord as an approximation to a given delta signature is the following (for simplicity, let’s talk about the fully DR case first): | The idea motivating least-squares error measures on a chord as an approximation to a given delta signature is the following (for simplicity, let’s talk about the fully DR case first): | ||
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>, i.e. a chord | We want the error of a chord {{nowrap|1:''r''<sub>1</sub>:''r''<sub>2</sub>:...:''r''<sub>''n''</sub>}} (in increasing order), with {{nowrap|''n'' &gt; 1}}, in the linear domain as an approximation to a fully delta-rational chord with signature {{nowrap|+δ<sub>1</sub> +δ<sub>2</sub> ... +δ<sub>''n''</sub>}}, i.e. a chord | ||
<math>x : x + \delta_1 : \cdots : x + \sum_{l=1}^n \delta_l</math> | <math>x : x + \delta_1 : \cdots : x + \sum_{l=1}^n \delta_l</math> | ||