Delta-rational chord: Difference between revisions

Inthar (talk | contribs)
Inthar (talk | contribs)
Line 88: Line 88:
</math>
</math>


To simplify, we use
We use the constraint


<math>
<math> 0 < \beta_1 < \beta_2 < \cdots < \beta_m </math>
\beta_i = \sum_{j=1}^i \alpha_j
</math>


and treat the DR chord as a union of fully DR chords
and treat the DR chord as a union of fully DR chords
Line 102: Line 100:
<math> \beta_i : \beta_ir_{i,1} : \cdots : \beta_i r_{i,n_i}. </math>
<math> \beta_i : \beta_ir_{i,1} : \cdots : \beta_i r_{i,n_i}. </math>


This implies the constraint
Here we require that each <math>\beta_i</math> be above the previous chord.
 
<math> 0 < \beta_1 < \beta_2 < \cdots < \beta_m </math>


and turns the objective function into a sum of univariate objective functions
This turns the objective function into a sum of univariate objective functions


<math> \displaystyle{ \sum_{k_i=1}^{n_i} \Bigg( \beta_i r_{i,k_i} - \beta_i - \sum_{{l_i}=1}^i \delta_{i,l_i} \Bigg)^2. } </math>
<math> \displaystyle{ \sum_{k_i=1}^{n_i} \Bigg( \beta_i r_{i,k_i} - \beta_i - \sum_{{l_i}=1}^i \delta_{i,l_i} \Bigg)^2. } </math>