A Simple Algorithm for Factorial Experiments in $\rho^N$
Donwonn Kim
Abstract
Donwonn Kim
Abstract
Factorial designs with two-level factors represent the smallest factorial experiments. The system of notation and confounding and fractional factorial schemes developed for the system are found in standard textbooks of experimental designs. Just as in the system, the general confounding and fractional factorial schemes are possible in , .... , and where is a prime number. Hence, we have the system. In this article, the author proposes a new algorithm for constructing fractional factorial plans in the system.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Factorial designs with two-level factors represent the smallest factorial experiments. The system of notation and confounding and fractional factorial schemes developed for the system are found in standard textbooks of experimental designs. Just as in the system, the general confounding and fractional factorial schemes are possible in , .... , and where is a prime number. Hence, we have the system. In this article, the author proposes a new algorithm for constructing fractional factorial plans in the system.
Key concepts: Fractional factorial design, Factorial, Factorial experiment, Mathematics, Plackett–Burman design, Confounding, Prime (order theory), Notation