Tukey is an English word. Below you'll find 10+ example sentences showing how it's used in practice.
Tukey in a sentence
Tukey meaning
A surname.
Using Tukey
- The main meaning on this page is: A surname.
- In the example corpus, tukey often appears in combinations such as: cooley tukey, tukey algorithm, john tukey.
Context around Tukey
- Average sentence length in these examples: 24.2 words
- Position in the sentence: 4 start, 7 middle, 5 end
- Sentence types: 16 statements, 0 questions, 0 exclamations
Corpus analysis for Tukey
- In this selection, "tukey" usually appears in the middle of the sentence. The average example has 24.2 words, and this corpus slice is mostly made up of statements.
- Around the word, cooley, siegel, john, algorithm, fft and cited stand out and add context to how "tukey" is used.
- Recognizable usage signals include and john tukey gave the and blackman and tukey cited nyquist. That gives this page its own corpus information beyond isolated example sentences.
- By corpus frequency, "tukey" sits close to words such as aaaa, abductees and abdulahi, which helps place it inside the broader word index.
Example types with tukey
The same corpus examples are grouped by length and sentence type, making it easier to see the contexts in which the word appears:
Quantiles Tukey criteria for anomalies. (5 words)
Other FFT algorithms main There are other FFT algorithms distinct from Cooley–Tukey. (13 words)
The values found by this method are also known as "Tukey's hinges". (13 words)
In 1958, Blackman and Tukey cited Nyquist's 1928 paper as a reference for the sampling theorem of information theory, citation even though that paper does not treat sampling and reconstruction of continuous signals as others did. (37 words)
Perhaps the simplest non-row-column FFT is the vector-radix FFT algorithm, which is a generalization of the ordinary Cooley–Tukey algorithm where one divides the transform dimensions by a vector of radices at each step. (37 words)
The upper bound on the relative error for the Cooley–Tukey algorithm is O(ε log N), compared to O(εN 3/2 ) for the naïve DFT formula, where ε is the machine floating-point relative precision. (37 words)
Example sentences (16)
Algorithms based on the Cooley–Tukey FFT algorithm are most common, but any other FFT algorithm is also applicable.
Also, because the Cooley–Tukey algorithm breaks the DFT into smaller DFTs, it can be combined arbitrarily with any other algorithm for the DFT, such as those described below.
In 1958, Blackman and Tukey cited Nyquist's 1928 paper as a reference for the sampling theorem of information theory, citation even though that paper does not treat sampling and reconstruction of continuous signals as others did.
In the view of Tukey the former produces a conclusion on the basis of only strong evidence while the latter produces a decision on the basis of available evidence.
Moreover, even achieving this accuracy requires careful attention to scaling to minimize loss of precision, and fixed-point FFT algorithms involve rescaling at each intermediate stage of decompositions like Cooley–Tukey.
Nicolas Bourbaki provided the definition of uniform structure in terms of entourages in the book Topologie Générale and John Tukey gave the uniform cover definition.
One approach consists of taking an ordinary algorithm (e.g. Cooley–Tukey) and removing the redundant parts of the computation, saving roughly a factor of two in time and memory.
Other FFT algorithms main There are other FFT algorithms distinct from Cooley–Tukey.
Perhaps the simplest non-row-column FFT is the vector-radix FFT algorithm, which is a generalization of the ordinary Cooley–Tukey algorithm where one divides the transform dimensions by a vector of radices at each step.
Quantiles Tukey criteria for anomalies.
Several non parametric tests have been proposed: these include the Barton–David–Ansari–Freund–Siegel–Tukey test, the Capon test, Mood test, the Klotz test and the Sukhatme test.
Some FFTs other than Cooley–Tukey, such as the Rader–Brenner algorithm, are intrinsically less stable.
The Mood, Klotz, Capon and Barton–David–Ansari–Freund–Siegel–Tukey tests also apply to two variances.
The term "software" was first proposed by Alan Turing and used in this sense by John W. Tukey in 1957.
The upper bound on the relative error for the Cooley–Tukey algorithm is O(ε log N), compared to O(εN 3/2 ) for the naïve DFT formula, where ε is the machine floating-point relative precision.
The values found by this method are also known as "Tukey's hinges".
Common combinations with tukey
These word pairs occur most frequently in English texts: