Please use this identifier to cite or link to this item:
https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1346
Title: | Miscellanea: Nearly orthogonal arrays mappable into fully orthogonal arrays |
Authors: | Mukerjee, Rahul Sun, Fasheng Tang, Boxin |
Keywords: | Computer experiment Difference scheme Resolvable array Space-filling design |
Issue Date: | 2014 |
Publisher: | SCOPUS Biometrika Oxford University Press |
Series/Report no.: | 101(4) |
Abstract: | We develop a method for construction of arrays which are nearly orthogonal, in the sense that each column is orthogonal to a large proportion of the other columns, and which are convertible to fully orthogonal arrays via a mapping of the symbols in each column to a possibly smaller set of symbols. These arrays can be useful in computer experiments as designs which accommodate a large number of factors and enjoy attractive space-filling properties. Our construction allows both the mappable nearly orthogonal array and the consequent fully orthogonal array to be either symmetric or asymmetric. Resolvable orthogonal arrays play a key role in the construction. � 2014 Biometrika Trust. |
Description: | Mukerjee Rahul, Indian Institute of Management Calcutta, Joka, Diamond Harbour Road, Kolkata, 700 104, India; Sun Fasheng, School of Mathematics and Statistics, Northeast Normal University, Changchun, 130024, China; Tang Boxin, Department of Statistics and Actuarial Science, Simon Fraser University, Burnaby, BC V5A 1S6, Canada ISSN/ISBN - 00063444 pp.957-963 DOI - 10.1093/biomet/asu042 |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84985916951&doi=10.1093%2fbiomet%2fasu042&partnerID=40&md5=2b39cfc5aeb1a5d17ab490ec22693fc3 https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1346 |
Appears in Collections: | Operations Management |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.