Tenney–Euclidean temperament measures: Difference between revisions

Wikispaces>genewardsmith
**Imported revision 154467605 - Original comment: **
Wikispaces>genewardsmith
**Imported revision 154974821 - Original comment: **
Line 1: Line 1:
<h2>IMPORTED REVISION FROM WIKISPACES</h2>
<h2>IMPORTED REVISION FROM WIKISPACES</h2>
This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2010-07-29 05:04:53 UTC</tt>.<br>
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2010-08-03 01:12:08 UTC</tt>.<br>
: The original revision id was <tt>154467605</tt>.<br>
: The original revision id was <tt>154974821</tt>.<br>
: The revision comment was: <tt></tt><br>
: The revision comment was: <tt></tt><br>
The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>
The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>
Line 9: Line 9:


===Wedgie Complexity===
===Wedgie Complexity===
Given a [[Wedgies and Multivals|wedgie]] W, that is a canonically reduced r-val correspondng to a temperament of rank r, the norm ||W|| is a measure of the //complexity// of W; that is, how many notes in some sort of weighted average it takes to get to intervals. For 1-vals, for instance, it is approximately equal to the numbner of scale steps it takes to reach an octave.
Given a [[Wedgies and Multivals|wedgie]] W, that is a canonically reduced r-val correspondng to a temperament of rank r, the norm ||W|| is a measure of the //complexity// of W; that is, how many notes in some sort of weighted average it takes to get to intervals. For 1-vals, for instance, it is approximately equal to the numbner of scale steps it takes to reach an octave. This complexity and related measures have been [[http://x31eq.com/temper/primerr.pdf|extensively studied]] by [[Graham Breed]].


Wedgie complexity is easily computed if a routine for computing multivectors is available. However such a routine is not required, as it can also be computed using the [[http://en.wikipedia.org/wiki/Gramian_matrix|Gramian]]. This is the determinant of the square matrix, called the Gram matrix, defined from a list of r vectors, whose (i,j)-th entry is vi.vj, the [[http://en.wikipedia.org/wiki/Dot_product|dot product]] of the ith vector with the jth vector. The square of the ordinary Euclidean norm of a multivector is the Gramian of the vectors wedged together to define it, and hence in terms of the RMS norm we have  
Wedgie complexity is easily computed if a routine for computing multivectors is available. However such a routine is not required, as it can also be computed using the [[http://en.wikipedia.org/wiki/Gramian_matrix|Gramian]]. This is the determinant of the square matrix, called the Gram matrix, defined from a list of r vectors, whose (i,j)-th entry is vi.vj, the [[http://en.wikipedia.org/wiki/Dot_product|dot product]] of the ith vector with the jth vector. The square of the ordinary Euclidean norm of a multivector is the Gramian of the vectors wedged together to define it, and hence in terms of the RMS norm we have  
Line 28: Line 28:
&lt;br /&gt;
&lt;br /&gt;
&lt;!-- ws:start:WikiTextHeadingRule:2:&amp;lt;h3&amp;gt; --&gt;&lt;h3 id="toc0"&gt;&lt;a name="x--Wedgie Complexity"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:2 --&gt;Wedgie Complexity&lt;/h3&gt;
&lt;!-- ws:start:WikiTextHeadingRule:2:&amp;lt;h3&amp;gt; --&gt;&lt;h3 id="toc0"&gt;&lt;a name="x--Wedgie Complexity"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:2 --&gt;Wedgie Complexity&lt;/h3&gt;
Given a &lt;a class="wiki_link" href="/Wedgies%20and%20Multivals"&gt;wedgie&lt;/a&gt; W, that is a canonically reduced r-val correspondng to a temperament of rank r, the norm ||W|| is a measure of the &lt;em&gt;complexity&lt;/em&gt; of W; that is, how many notes in some sort of weighted average it takes to get to intervals. For 1-vals, for instance, it is approximately equal to the numbner of scale steps it takes to reach an octave.&lt;br /&gt;
Given a &lt;a class="wiki_link" href="/Wedgies%20and%20Multivals"&gt;wedgie&lt;/a&gt; W, that is a canonically reduced r-val correspondng to a temperament of rank r, the norm ||W|| is a measure of the &lt;em&gt;complexity&lt;/em&gt; of W; that is, how many notes in some sort of weighted average it takes to get to intervals. For 1-vals, for instance, it is approximately equal to the numbner of scale steps it takes to reach an octave. This complexity and related measures have been &lt;a class="wiki_link_ext" href="http://x31eq.com/temper/primerr.pdf" rel="nofollow"&gt;extensively studied&lt;/a&gt; by &lt;a class="wiki_link" href="/Graham%20Breed"&gt;Graham Breed&lt;/a&gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Wedgie complexity is easily computed if a routine for computing multivectors is available. However such a routine is not required, as it can also be computed using the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Gramian_matrix" rel="nofollow"&gt;Gramian&lt;/a&gt;. This is the determinant of the square matrix, called the Gram matrix, defined from a list of r vectors, whose (i,j)-th entry is vi.vj, the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Dot_product" rel="nofollow"&gt;dot product&lt;/a&gt; of the ith vector with the jth vector. The square of the ordinary Euclidean norm of a multivector is the Gramian of the vectors wedged together to define it, and hence in terms of the RMS norm we have &lt;br /&gt;
Wedgie complexity is easily computed if a routine for computing multivectors is available. However such a routine is not required, as it can also be computed using the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Gramian_matrix" rel="nofollow"&gt;Gramian&lt;/a&gt;. This is the determinant of the square matrix, called the Gram matrix, defined from a list of r vectors, whose (i,j)-th entry is vi.vj, the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Dot_product" rel="nofollow"&gt;dot product&lt;/a&gt; of the ith vector with the jth vector. The square of the ordinary Euclidean norm of a multivector is the Gramian of the vectors wedged together to define it, and hence in terms of the RMS norm we have &lt;br /&gt;