Package {SCCDdesign}

Constructs an SCCD for a specified number of runs (n=2m). The construction method is selected automatically according to the number of runs.

Description

Constructs an SCCD for a specified number of runs (n=2m). The construction method is selected automatically according to the number of runs.

Usage

SCCD(n)

Arguments

Details

Method I is used when n is divisible by 8. Method II is used when n is divisible by 4 but not by 8. Method III is used when n is even but not divisible by 4.

Value

A numeric SCCD matrix containing m continuous and m-1 categorical factors.

Examples

SCCD(16)

Construct Saturated screening designs for continous and categorical factor (SCCD) Using Method I Constructs an SCCD when the number of runs (n=2m) is divisible by 8, using a conference matrix and a Hadamard matrix. The number of continuous factor is m and the number of categorical factors is m-1)

Description

Construct Saturated screening designs for continous and categorical factor (SCCD) Using Method I Constructs an SCCD when the number of runs (n=2m) is divisible by 8, using a conference matrix and a Hadamard matrix. The number of continuous factor is m and the number of categorical factors is m-1)

Usage

SCCD_method1(n)

Arguments

Value

A numeric SCCD matrix.

Construct SCCD Using Method II Constructs an SCCD when the number of runs (n=2m) is divisible by 4 but not divisible by 8, using a conference matrix and a D-optimal two-level design. The number of continuous factor is m and number of categorical factors is m-1

Description

Construct SCCD Using Method II Constructs an SCCD when the number of runs (n=2m) is divisible by 4 but not divisible by 8, using a conference matrix and a D-optimal two-level design. The number of continuous factor is m and number of categorical factors is m-1

Usage

SCCD_method2(n)

Arguments

Value

A numeric SCCD matrix.

Construct SCCD Using Method III Constructs an SCCD when the number of runs (n=2m) is even but not divisible by 4, using a pseudo-conference matrix and a D-optimal two-level design. The number of continuous factor is m and the number of categorical factors is m-1)

Description

Construct SCCD Using Method III Constructs an SCCD when the number of runs (n=2m) is even but not divisible by 4, using a pseudo-conference matrix and a D-optimal two-level design. The number of continuous factor is m and the number of categorical factors is m-1)

Usage

SCCD_method3(n, starts = 1000, max.iter = 100)

Arguments

Value

A numeric SCCD matrix.

Constructs a conference matrix of a specified order using a direct construction for order 2 and Paley-based constructions for supported odd prime or prime-power values of q = n - 1.

Description

Constructs a conference matrix of a specified order using a direct construction for order 2 and Paley-based constructions for supported odd prime or prime-power values of q = n - 1.

Usage

conferenceMatrix(n)

Arguments

Details

For n = 2, the conference matrix is constructed directly. For larger orders, the function sets q = n - 1 and determines whether q is a supported odd prime or odd prime power. Depending on the value of q modulo 4, the corresponding Paley construction is used. An error is returned when the supplied order does not satisfy the requirements of the implemented construction.

Value

A numeric n \times n conference matrix.

Examples

conferenceMatrix(6)

Constructs a D-optimal two-level design with m runs and m - 1 factors. The factor levels are coded as -1 and +1.

Description

Constructs a D-optimal two-level design with m runs and m - 1 factors. The factor levels are coded as -1 and +1.

Usage

dOptimalTwoLevel(m)

Arguments

Details

The candidate set is generated using all possible combinations of -1 and +1 for the factors. The D-optimal design is selected using AlgDesign::optFederov().

Value

A numeric matrix containing the D-optimal two-level design.

Examples

dOptimalTwoLevel(4)
dOptimalTwoLevel(8)

Generate Elements of a Finite Field Generates the coefficient-vector representations of all elements of GF(p^m).

Description

Generate Elements of a Finite Field Generates the coefficient-vector representations of all elements of GF(p^m).

Usage

generateGF(p, m)

Arguments

Value

A matrix containing all elements of GF(p^m).

Finite-Field Addition Adds two finite-field elements componentwise modulo p.

Description

Finite-Field Addition Adds two finite-field elements componentwise modulo p.

Usage

gfAdd(a, b, p)

Arguments

Value

The sum of the two elements modulo p.

Finite-Field Multiplication Multiplies two elements of GF(p^m) using polynomial multiplication and reduction.

Description

Finite-Field Multiplication Multiplies two elements of GF(p^m) using polynomial multiplication and reduction.

Usage

gfMultiply(a, b, p, modulus)

Arguments

Value

The product of the two finite-field elements.

Finite-Field Subtractio Subtracts two finite-field elements componentwise modulo p.

Description

Finite-Field Subtractio Subtracts two finite-field elements componentwise modulo p.

Usage

gfSubtract(a, b, p)

Arguments

Value

The difference of the two elements modulo p.

Constructs a Hadamard matrix of order n using pracma::hadamard().

Description

Constructs a Hadamard matrix of order n using pracma::hadamard().

Usage

hadamardMatrix(n)

Arguments

Details

A Hadamard matrix contains only +1 and -1, and its rows are mutually orthogonal. The supported orders are of the forms 2^e, 12(2^e), and 20(2^e).

Value

A Hadamard matrix of order n.

Examples

hadamardMatrix(4)
hadamardMatrix(8)
hadamardMatrix(12)

Convert an Integer to a Finite-Field Element Converts an integer to its coefficient-vector representation in GF(p^m).

Description

Convert an Integer to a Finite-Field Element Converts an integer to its coefficient-vector representation in GF(p^m).

Usage

intToGF(x, p, m)

Arguments

Value

An integer vector representing an element of GF(p^m).

Irreducible Polynomial Returns a predefined irreducible polynomial used for constructing the finite field GF(p^m).

Description

Irreducible Polynomial Returns a predefined irreducible polynomial used for constructing the finite field GF(p^m).

Usage

irreduciblePolynomial(p, m)

Arguments

Value

A numeric vector containing the polynomial coefficients.

Check for a Prime Number. Checks whether a given number is prime.

Description

Check for a Prime Number. Checks whether a given number is prime.

Usage

is_prime(q)

Arguments

Value

TRUE if q is prime and FALSE otherwise.

Check for a Prime Power. Checks whether q is a prime or a power of a prime number.

Description

Check for a Prime Power. Checks whether q is a prime or a power of a prime number.

Usage

is_prime_power(q)

Arguments

Value

TRUE if q is a prime or prime power and FALSE otherwise.

Jacobsthal Matrix for a Prime Constructs a Jacobsthal matrix when q is prime using the quadratic character modulo q.

Description

Jacobsthal Matrix for a Prime Constructs a Jacobsthal matrix when q is prime using the quadratic character modulo q.

Usage

jacobsthalPrime(q)

Arguments

Value

A numeric Jacobsthal matrix of order q.

Jacobsthal Matrix for a Prime Power Constructs a Jacobsthal matrix over the finite field GF(p^m) when q = p^m is an odd prime power.

Description

Jacobsthal Matrix for a Prime Power Constructs a Jacobsthal matrix over the finite field GF(p^m) when q = p^m is an odd prime power.

Usage

jacobsthalPrimePower(q)

Arguments

Value

A numeric Jacobsthal matrix of order q.

Paley Conference Matrix for a Prime Constructs a Paley conference matrix of order n when q = n - 1 is an odd prime.

Description

Paley Conference Matrix for a Prime Constructs a Paley conference matrix of order n when q = n - 1 is an odd prime.

Usage

paleyPrime(n)

Arguments

Value

A numeric conference matrix of order n.

Paley Conference Matrix for a Prime Power Constructs a Paley conference matrix of order n when q = n - 1 is an odd prime power.

Description

Paley Conference Matrix for a Prime Power Constructs a Paley conference matrix of order n when q = n - 1 is an odd prime power.

Usage

paleyPrimePower(n)

Arguments

Value

A numeric conference matrix of order n.

Polynomial Multiplication over GF(p Multiplies two polynomials with coefficients in GF(p).

Description

Polynomial Multiplication over GF(p Multiplies two polynomials with coefficients in GF(p).

Usage

polyMultiply(a, b, p)

Arguments

Value

A vector containing the coefficients of the product modulo p.

Polynomial Reduction over GF(p) Reduces a polynomial modulo a specified irreducible polynomial over GF(p).

Description

Polynomial Reduction over GF(p) Reduces a polynomial modulo a specified irreducible polynomial over GF(p).

Usage

polyReduce(poly, modulus, p)

Arguments

Value

The reduced polynomial as a coefficient vector.

Identify a Prime Power Determines whether q can be expressed as p^m, where p is a prime number and m is a positive integer.

Description

Identify a Prime Power Determines whether q can be expressed as p^m, where p is a prime number and m is a positive integer.

Usage

primePowerInfo(q)

Arguments

Value

A list containing p and m if q is a prime or prime power; otherwise NULL.

Constructs a pseudo-conference matrix of order n using a determinant-based search procedure.

Description

Constructs a pseudo-conference matrix of order n using a determinant-based search procedure.

Usage

pseudoConference(n, starts = 1000, max.iter = 100)

Arguments

Details

The matrix has zero diagonal elements and off-diagonal elements equal to -1 or +1. The search selects a matrix by maximizing the determinant criterion.

Value

A list containing the pseudo-conference matrix and the corresponding log-determinant value.

Examples

result <- pseudoConference(6, starts = 10, max.iter = 10)
result$Matrix
result$LogDet

Quadratic Character in a Finite Field Computes the quadratic character of an element of GF(p^m). It returns 0 for the zero element, 1 for a nonzero quadratic residue, and -1 otherwise.

Description

Quadratic Character in a Finite Field Computes the quadratic character of an element of GF(p^m). It returns 0 for the zero element, 1 for a nonzero quadratic residue, and -1 otherwise.

Usage

quadraticCharacterGF(x, QR)

Arguments

Value

The quadratic character: 0, 1, or -1.

Quadratic Character Modulo a Prime Computes the quadratic character of an integer modulo a prime. It returns 0 for zero, 1 for a quadratic residue, and -1 otherwise.

Description

Quadratic Character Modulo a Prime Computes the quadratic character of an integer modulo a prime. It returns 0 for zero, 1 for a quadratic residue, and -1 otherwise.

Usage

quadraticCharacterPrime(x, q, QR)

Arguments

Value

The quadratic character: 0, 1, or -1.

Quadratic Residues in a Finite Field Finds the nonzero quadratic residues in GF(p^m).

Description

Quadratic Residues in a Finite Field Finds the nonzero quadratic residues in GF(p^m).

Usage

quadraticResiduesGF(p, m)

Arguments

Value

A matrix containing the nonzero quadratic residues of GF(p^m).

Quadratic Residues Modulo a Prime Computes the nonzero quadratic residues modulo a prime number.

Description

Quadratic Residues Modulo a Prime Computes the nonzero quadratic residues modulo a prime number.

Usage

quadraticResiduesPrime(q)

Arguments

Value

A vector containing the nonzero quadratic residues modulo q.

Remove Duplicate Finite-Field Elements Removes duplicate rows from a matrix of finite-field elements.

Description

Remove Duplicate Finite-Field Elements Removes duplicate rows from a matrix of finite-field elements.

Usage

uniqueGFElements(M)

Arguments

Value

A matrix containing the unique finite-field elements.