An algorithm for arranging response surface designs in small blocks

Luzia A. Trinca; Steven G. Gilmour

An algorithm for arranging response surface designs in small blocks

Luzia A. Trinca^*, Steven G. Gilmour

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

38 Citations (Scopus)

Abstract

We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made.

Original language	English
Pages (from-to)	25-43
Number of pages	19
Journal	COMPUTATIONAL STATISTICS AND DATA ANALYSIS
Volume	33
Issue number	1
Publication status	Published - 28 Mar 2000

Keywords

Blocking
Box-Behnken design
Central composite design
Interchange algorithm
Scores
Second-order model
Weighted mean efficiency factor

Cite this

@article{d650bf9764824372a0a70d939784be5e,

title = "An algorithm for arranging response surface designs in small blocks",

abstract = "We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made.",

keywords = "Blocking, Box-Behnken design, Central composite design, Interchange algorithm, Scores, Second-order model, Weighted mean efficiency factor",

author = "Trinca, {Luzia A.} and Gilmour, {Steven G.}",

year = "2000",

month = mar,

day = "28",

language = "English",

volume = "33",

pages = "25--43",

journal = "COMPUTATIONAL STATISTICS AND DATA ANALYSIS",

issn = "0167-9473",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - An algorithm for arranging response surface designs in small blocks

AU - Trinca, Luzia A.

AU - Gilmour, Steven G.

PY - 2000/3/28

Y1 - 2000/3/28

N2 - We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made.

AB - We consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made.

KW - Blocking

KW - Box-Behnken design

KW - Central composite design

KW - Interchange algorithm

KW - Scores

KW - Second-order model

KW - Weighted mean efficiency factor

UR - http://www.scopus.com/inward/record.url?scp=0033882183&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033882183

SN - 0167-9473

VL - 33

SP - 25

EP - 43

JO - COMPUTATIONAL STATISTICS AND DATA ANALYSIS

JF - COMPUTATIONAL STATISTICS AND DATA ANALYSIS

IS - 1

ER -

An algorithm for arranging response surface designs in small blocks

Abstract

Keywords

Other files and links

Fingerprint

Cite this