An efficient method for the calculation of the interactions of a 2m factorial experiment was introduced by Yates and is widely known by his name. The generalization to 3m was given by Box et al. [1]. Good [2] generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series. In their full generality, Good's methods are applicable to certain problems in which one must multiply an JV-vector by an JV X N matrix which can be factored into m sparse matrices, where m is proportional to log JV. This results in a procedure requiring a number of operations proportional to JV log JV rather than JV2. These methods are applied here to the calculation of complex Fourier series. They are useful in situations where the number of data points is, or can be chosen to be, a highly composite number. The algorithm is here derived and presented in a rather different form. Attention is given to the choice of JV. It is also shown how special advantage can be obtained in the use of a binary computer with JV = 2m and how the entire calculation can be performed within the array of JV data storage locations used for the given Fourier coefficients.Consider the problem of calculating the complex Fourier series A straightforward calculation using ( 1 ) would require JV2 operations where "operation" means, as it will throughout this note, a complex multiplication followed by a complex addition.The algorithm described here iterates on the array of given complex Fourier amplitudes and yields the result in less than 2JV Iog2 JV operations without requiring more data storage than is required for the given array A. To derive the algorithm, suppose JV is a composite, i.e., JV = rvr2. Then let the indices in (1)
An efficient method for the calculation of the interactions of a 2m factorial experiment was introduced by Yates and is widely known by his name. The generalization to 3m was given by Box et al. [1]. Good [2] generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series. In their full generality, Good's methods are applicable to certain problems in which one must multiply an JV-vector by an JV X N matrix which can be factored into m sparse matrices, where m is proportional to log JV. This results in a procedure requiring a number of operations proportional to JV log JV rather than JV2. These methods are applied here to the calculation of complex Fourier series. They are useful in situations where the number of data points is, or can be chosen to be, a highly composite number. The algorithm is here derived and presented in a rather different form. Attention is given to the choice of JV. It is also shown how special advantage can be obtained in the use of a binary computer with JV = 2m and how the entire calculation can be performed within the array of JV data storage locations used for the given Fourier coefficients.Consider the problem of calculating the complex Fourier series A straightforward calculation using ( 1 ) would require JV2 operations where "operation" means, as it will throughout this note, a complex multiplication followed by a complex addition.The algorithm described here iterates on the array of given complex Fourier amplitudes and yields the result in less than 2JV Iog2 JV operations without requiring more data storage than is required for the given array A. To derive the algorithm, suppose JV is a composite, i.e., JV = rvr2. Then let the indices in (1)
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.. International Biometric Society is collaborating with JSTOR to digitize, preserve and extend access to Biometrics.The practitioner of the analysis of variance often wants to draw as many conclusions as are reasonable about the relation of the true means for individual "treatments," and a statement by the F-test (or the z-test) that they are not all alike leaves him thoroughly unsatisfied. The problem of breaking up the treatment means into distinguishable groups has not been discussed at much length, the solutions given in the various textbooks differ and, what is more important, seem solely based on intuition.After discussing the problem on a basis combining intuition with some hard, cold facts about the distributions of certain test quantities (or "statistics") a simple and definite procedure is proposed for dividing treatments into distinguishable groups, and for determining that the treatments within some of these groups are different, although there is not enough evidence to say "which is which." The procedure is illustrated on examples. DISCUSSION OF THE PROBLEM
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.