Orthogonal array | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In mathematics, an orthogonal array (more specifically, a fixed-level orthogonal array) is a "table" (array) whose entries come from a fixed finite set of symbols (for example, {1,2,...,v}), arranged in such a way that there is an integer t so that for every selection of t columns of the table, all ordered t-tuples of the symbols, formed by taking the entries in each row restricted to these columns, appear the same number of times. The number t is called the strength of the orthogonal array. Here are two examples: The example at left is that of an orthogonal array with symbol set {1,2} and strength 2. Notice that the four ordered pairs (2-tuples) formed by the rows restricted to the first and third columns, namely (1,1), (2,1), (1,2) and (2,2), are all the possible ordered pairs of the two element set and each appears exactly once. The second and third columns would give, (1,1), (2,1), (2,2) and (1,2); again, all possible ordered pairs each appearing once. The same statement would hold had the first and second columns been used. This is thus an orthogonal array of strength two. In the example on the right, the rows restricted to the first three columns contain the 8 possible ordered triples consisting of 0's and 1's, each appearing once. The same holds for any other choice of three columns. Thus this is an orthogonal array of strength 3. A mixed-level orthogonal array is one in which each column may have a different number of symbols. An example is given below. Orthogonal arrays generalize, in a tabular form, the idea of mutually orthogonal Latin squares. These arrays have many connections to other combinatorial designs and have applications in the statistical design of experiments, coding theory, cryptography and various types of software testing. For t ≤ k, an orthogonal array of type (N, k, v, t) – an OA(N, k, v, t) for short – is an N × k array whose entries are chosen from a set X with v points (a v-set) such that in every subset of t columns of the array, every t-tuple of points of X is repeated the same number of times.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (25)

RMAML: Riemannian meta-learning with orthogonality constraints

Soumava Kumar Roy

Meta-learning is the core capability that enables intelligent systems to rapidly generalize their prior ex-perience to learn new tasks. In general, the optimization-based methods formalize the meta-learning as a bi-level optimization problem, that is a nes ...

ELSEVIER SCI LTD2023

, , ,

Multi-ion potentiometric sensing becomes challenging for mixed-ion samples in which interfering electrolytes significantly alter the response of each single sensor. Therefore, an emulator based on the phase-boundary potential model is proposed to simulate ...

IEEE2020

Symplectic dynamical low rank approximation of wave equations with random parameters

Fabio Nobile, Eleonora Musharbash, Eva Vidlicková

In this paper we propose a dynamical low-rank strategy for the approximation of second order wave equations with random parameters. The governing equation is rewritten in Hamiltonian form and the approximate solution is expanded over a set of 2S dynamical ...

2020

Related people (2)

Fabio Nobile, Eleonora Musharbash

Related units (3)

Signal Processing Laboratory 4

Integrated Systems Laboratory (IC/STI)

Scientific Computing and Uncertainty Quantification - CADMOS Chair

Related concepts (4)

Related courses (4)

MATH-336: Randomization and causation

This course covers formal frameworks for causal inference. We focus on experimental designs, definitions of causal models, interpretation of causal parameters and estimation of causal effects.

PHYS-442: Modeling and design of experiments

In the academic or industrial world, to optimize a system, it is necessary to establish strategies for the experimental approach. The DOE allows you to choose the best set of measurement points to min

MICRO-110: Design of experiments

This course provides an introduction to experimental statistics, including use of population statistics to characterize experimental results, use of comparison statistics and hypothesis testing to eva

Related lectures (22)

Combinatorial design

Combinatorial design theory is the part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. These concepts are not made precise so that a wide range of objects can be thought of as being under the same umbrella. At times this might involve the numerical sizes of set intersections as in block designs, while at other times it could involve the spatial arrangement of entries in an array as in sudoku grids.

Factorial experiment

In statistics, a full factorial experiment is an experiment whose design consists of two or more factors, each with discrete possible values or "levels", and whose experimental units take on all possible combinations of these levels across all such factors. A full factorial design may also be called a fully crossed design. Such an experiment allows the investigator to study the effect of each factor on the response variable, as well as the effects of interactions between factors on the response variable.

Mutually orthogonal Latin squares

In combinatorial mathematics, two Latin squares of the same size (order) are said to be orthogonal if when superimposed the ordered paired entries in the positions are all distinct. A set of Latin squares, all of the same order, all pairs of which are orthogonal is called a set of mutually orthogonal Latin squares. This concept of orthogonality in combinatorics is strongly related to the concept of blocking in statistics, which ensures that independent variables are truly independent with no hidden confounding correlations.

Covers the optimization of a workshop through qualitative factors analysis and modeling.

Explores fractional factorial design basics, including blocking alias, interaction effects, and design comparison.

Covers statistical design of experiments, focusing on minimizing costs and maximizing accuracy.