Group Strong Orthogonal Arrays with Appealing Two-Dimensional Space-Filling Property
Space-filling designs are popular for computer experiments. Therein space-filling designs with good two-dimensional projection are preferred as two-factor interactions are more likely to be important than three- or higher-order interactions in practice. Considering two-dimensional projection, the au...
Saved in:
Published in | Journal of systems science and complexity Vol. 38; no. 4; pp. 1747 - 1765 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.08.2025
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
ISSN | 1009-6124 1559-7067 |
DOI | 10.1007/s11424-025-3567-z |
Cover
Loading…
Abstract | Space-filling designs are popular for computer experiments. Therein space-filling designs with good two-dimensional projection are preferred as two-factor interactions are more likely to be important than three- or higher-order interactions in practice. Considering two-dimensional projection, the authors propose a new class of designs called group strong orthogonal arrays. A group strong orthogonal array enjoys attractive two-dimensional space-filling property in the sense that it can be partitioned into groups, where any two columns can achieve stratifications on
s
u
1
×
s
u
2
grids for any positive integers
u
1
,
u
2
with
u
1
+
u
2
= 3, and any two columns from different groups can achieve stratifications on
s
v
1
×
s
v
2
grids for any positive integers
v
1
,
v
2
with
v
1
+
v
2
= 4. Few existing designs enjoy such appealing two-dimensional stratification property in the literature. And the level numbers of the obtained designs can be
s
3
or
s
4
. In addition to the attractive stratification property, the proposed designs perform very well under orthogonality and uniform projection criteria, and are flexible in run sizes, rendering them highly suitable for computer experiments. |
---|---|
AbstractList | Space-filling designs are popular for computer experiments. Therein space-filling designs with good two-dimensional projection are preferred as two-factor interactions are more likely to be important than three- or higher-order interactions in practice. Considering two-dimensional projection, the authors propose a new class of designs called group strong orthogonal arrays. A group strong orthogonal array enjoys attractive two-dimensional space-filling property in the sense that it can be partitioned into groups, where any two columns can achieve stratifications on
s
u
1
×
s
u
2
grids for any positive integers
u
1
,
u
2
with
u
1
+
u
2
= 3, and any two columns from different groups can achieve stratifications on
s
v
1
×
s
v
2
grids for any positive integers
v
1
,
v
2
with
v
1
+
v
2
= 4. Few existing designs enjoy such appealing two-dimensional stratification property in the literature. And the level numbers of the obtained designs can be
s
3
or
s
4
. In addition to the attractive stratification property, the proposed designs perform very well under orthogonality and uniform projection criteria, and are flexible in run sizes, rendering them highly suitable for computer experiments. Space-filling designs are popular for computer experiments. Therein space-filling designs with good two-dimensional projection are preferred as two-factor interactions are more likely to be important than three- or higher-order interactions in practice. Considering two-dimensional projection, the authors propose a new class of designs called group strong orthogonal arrays. A group strong orthogonal array enjoys attractive two-dimensional space-filling property in the sense that it can be partitioned into groups, where any two columns can achieve stratifications on su1×su2 grids for any positive integers u1, u2 with u1 + u2 = 3, and any two columns from different groups can achieve stratifications on sv1×sv2 grids for any positive integers v1, v2 with v1 + v2 = 4. Few existing designs enjoy such appealing two-dimensional stratification property in the literature. And the level numbers of the obtained designs can be s3 or s4. In addition to the attractive stratification property, the proposed designs perform very well under orthogonality and uniform projection criteria, and are flexible in run sizes, rendering them highly suitable for computer experiments. |
Author | Yang, Jinyu Wang, Chunyan |
Author_xml | – sequence: 1 givenname: Chunyan surname: Wang fullname: Wang, Chunyan organization: Center for Applied Statistics and School of Statistics, Renmin University of China – sequence: 2 givenname: Jinyu surname: Yang fullname: Yang, Jinyu email: jyyang@nankai.edu.cn organization: NITFID, LPMC & KLMDASR, School of Statistics and Data Science, Nankai University |
BookMark | eNp1kNFrwjAQxsNwMHX7A_ZW2HO2S5o26aO46QaCA91zSNtUK7XJkoroX79oB3vaw3EH9_vuPr4RGrSm1Qg9EngmAPzFE8Iow0ATHCcpx-cbNCRJkmEOKR-EGSDDKaHsDo283wHEaQZiiNZzZw42WnXOtJto6bqt2ZhWNdHEOXXy0bHuttHEWq2aOgDro8Gv9V63vr5SK6sKjWd1c91-OmO160736LZSjdcPv32MvmZv6-k7XiznH9PJAheUQ4dZloqSi1KQkmZlxoiIVUxoAomGUKwMDguRVBnNicgrpqASheKE50Ua50zHY_TU37XOfB-07-TOHFzw5WVMwwtGGGeBIj1VOOO905W0rt4rd5IE5CU82YcnQ3jyEp48Bw3tNT6w7Ua7v8v_i34A0cBz6Q |
Cites_doi | 10.1080/01621459.1993.10476423 10.1093/biomet/ass065 10.3150/19-BEJ1130 10.1093/biomet/asz043 10.1007/978-1-4612-1478-6 10.1007/s00180-012-0359-4 10.1214/18-AOS1705 10.1080/01621459.2021.1935268 10.1093/biomet/asu042 10.1214/14-AOS1225 10.1093/biomet/asab021 10.1090/S0025-5718-98-00894-1 10.1007/978-1-4939-8847-1 10.1007/s00362-014-0618-2 10.1002/cjs.11686 10.1214/17-AOS1555 10.1090/S0025-5718-00-01281-3 |
ContentType | Journal Article |
Copyright | The Editorial Office of JSSC & Springer-Verlag GmbH Germany 2025 The Editorial Office of JSSC & Springer-Verlag GmbH Germany 2025. |
Copyright_xml | – notice: The Editorial Office of JSSC & Springer-Verlag GmbH Germany 2025 – notice: The Editorial Office of JSSC & Springer-Verlag GmbH Germany 2025. |
DBID | AAYXX CITATION |
DOI | 10.1007/s11424-025-3567-z |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Statistics Mathematics |
EISSN | 1559-7067 |
EndPage | 1765 |
ExternalDocumentID | 10_1007_s11424_025_3567_z |
GroupedDBID | -SA -S~ -Y2 .86 .VR 06D 0R~ 0VY 1N0 29L 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2~H 30V 4.4 406 408 40D 40E 5GY 5VR 5VS 5XA 5XB 6NX 8TC 95- 95. 95~ 96X AAAVM AABHQ AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABDBE ABDZT ABECU ABFSG ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACSNA ACSTC ACZOJ ADHHG ADHIR ADHKG ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFGCZ AFHIU AFLOW AFOHR AFQWF AFUIB AFWTZ AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AZFZN B-. BA0 BAPOH BDATZ BGNMA BSONS CAG CAJEA CCEZO CCVFK CHBEP COF CS3 CSCUP CW9 DDRTE DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FA0 FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 H13 HF~ HG6 HLICF HMJXF HRMNR HVGLF HZ~ IJ- IKXTQ IWAJR IXD I~X I~Z J-C JBSCW JZLTJ KDC KOV LLZTM M4Y MA- N2Q NPVJJ NQJWS NU0 O9- O93 O9J P9R PF0 PT4 Q-- QOS R89 R9I REI ROL RPX RSV S16 S1Z S27 S3B SAP SCL SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TUC U1G U2A U5K UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR ZMTXR ~A9 AAYXX CITATION ABRTQ |
ID | FETCH-LOGICAL-c270t-4968d78d81d29d94183a312505e005e4d908c85f92b18bf4a0f8ca717bc63b4e3 |
IEDL.DBID | U2A |
ISSN | 1009-6124 |
IngestDate | Sun Jul 13 04:34:58 EDT 2025 Thu Jul 10 08:19:14 EDT 2025 Fri Jul 04 01:21:03 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 4 |
Keywords | uniformity Computer experiment orthogonality group strong orthogonal array |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c270t-4968d78d81d29d94183a312505e005e4d908c85f92b18bf4a0f8ca717bc63b4e3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
PQID | 3227041474 |
PQPubID | 2044418 |
PageCount | 19 |
ParticipantIDs | proquest_journals_3227041474 crossref_primary_10_1007_s11424_025_3567_z springer_journals_10_1007_s11424_025_3567_z |
PublicationCentury | 2000 |
PublicationDate | 2025-08-01 |
PublicationDateYYYYMMDD | 2025-08-01 |
PublicationDate_xml | – month: 08 year: 2025 text: 2025-08-01 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | Berlin/Heidelberg |
PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
PublicationTitle | Journal of systems science and complexity |
PublicationTitleAbbrev | J Syst Sci Complex |
PublicationYear | 2025 |
Publisher | Springer Berlin Heidelberg Springer Nature B.V |
Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V |
References | M D McKay (3567_CR4) 1979; 21 Z Ou (3567_CR21) 2015; 56 Y Zhou (3567_CR18) 2019; 106 B Tang (3567_CR6) 1993; 88 Y Z He (3567_CR13) 2018; 46 K T Fang (3567_CR1) 2006 F Sun (3567_CR8) 2019; 47 H Y Liu (3567_CR14) 2015; 25 C F J Wu (3567_CR3) 2009 Y Z He (3567_CR12) 2014; 42 C Y Wang (3567_CR17) 2022; 32 A S Hedayat (3567_CR24) 1999 F Hickernell (3567_CR19) 1998; 67 K T Fang (3567_CR20) 2002; 71 3567_CR9 K A Osuolale (3567_CR7) 2021; 6 Y Z He (3567_CR10) 2013; 100 Y D Zhou (3567_CR22) 2013; 28 T J Santner (3567_CR2) 2018 C Y Sun (3567_CR23) 2021; 118 A B Owen (3567_CR5) 1992; 2 C Shi (3567_CR15) 2020; 26 Y Tian (3567_CR16) 2022; 109 R Mukerjee (3567_CR11) 2014; 101 |
References_xml | – volume-title: Design and Modeling for Computer Experiments year: 2006 ident: 3567_CR1 – volume: 88 start-page: 1392 year: 1993 ident: 3567_CR6 publication-title: J. Amer. Statist. Assoc. doi: 10.1080/01621459.1993.10476423 – volume: 6 start-page: 92 issue: 4 year: 2021 ident: 3567_CR7 publication-title: Math. Model. and Appli. – volume: 100 start-page: 254 year: 2013 ident: 3567_CR10 publication-title: Biometrika doi: 10.1093/biomet/ass065 – volume: 26 start-page: 418 year: 2020 ident: 3567_CR15 publication-title: Bernoulli doi: 10.3150/19-BEJ1130 – volume: 106 start-page: 997 year: 2019 ident: 3567_CR18 publication-title: Biometrika doi: 10.1093/biomet/asz043 – volume-title: Orthogonal Arrays: Theory and Applications year: 1999 ident: 3567_CR24 doi: 10.1007/978-1-4612-1478-6 – volume: 28 start-page: 1319 year: 2013 ident: 3567_CR22 publication-title: Comput. Stat. doi: 10.1007/s00180-012-0359-4 – volume: 47 start-page: 641 year: 2019 ident: 3567_CR8 publication-title: Ann. Statist. doi: 10.1214/18-AOS1705 – volume: 118 start-page: 417 year: 2021 ident: 3567_CR23 publication-title: J. Amer. Statist. Assoc. doi: 10.1080/01621459.2021.1935268 – volume: 101 start-page: 957 year: 2014 ident: 3567_CR11 publication-title: Biometrika doi: 10.1093/biomet/asu042 – volume: 42 start-page: 1347 year: 2014 ident: 3567_CR12 publication-title: Ann. Statist. doi: 10.1214/14-AOS1225 – volume: 109 start-page: 489 year: 2022 ident: 3567_CR16 publication-title: Biometrika doi: 10.1093/biomet/asab021 – volume: 2 start-page: 439 year: 1992 ident: 3567_CR5 publication-title: Statist. Sinica – volume: 67 start-page: 299 year: 1998 ident: 3567_CR19 publication-title: Math. Comput. doi: 10.1090/S0025-5718-98-00894-1 – volume-title: The Design and Analysis of Computer Experiments year: 2018 ident: 3567_CR2 doi: 10.1007/978-1-4939-8847-1 – volume: 32 start-page: 1225 year: 2022 ident: 3567_CR17 publication-title: Statist. Sinica – volume: 21 start-page: 239 year: 1979 ident: 3567_CR4 publication-title: Technometrics – volume-title: Experiments: Planning, Analysis, and Optimization year: 2009 ident: 3567_CR3 – volume: 25 start-page: 1713 year: 2015 ident: 3567_CR14 publication-title: Statist. Sinica – volume: 56 start-page: 969 year: 2015 ident: 3567_CR21 publication-title: Statist. Papers doi: 10.1007/s00362-014-0618-2 – ident: 3567_CR9 doi: 10.1002/cjs.11686 – volume: 46 start-page: 457 year: 2018 ident: 3567_CR13 publication-title: Ann. Statist. doi: 10.1214/17-AOS1555 – volume: 71 start-page: 275 year: 2002 ident: 3567_CR20 publication-title: Math. Comput. doi: 10.1090/S0025-5718-00-01281-3 |
SSID | ssj0036908 |
Score | 2.3489292 |
Snippet | Space-filling designs are popular for computer experiments. Therein space-filling designs with good two-dimensional projection are preferred as two-factor... |
SourceID | proquest crossref springer |
SourceType | Aggregation Database Index Database Publisher |
StartPage | 1747 |
SubjectTerms | Complex Systems Control Integers Mathematics Mathematics and Statistics Mathematics of Computing Operations Research/Decision Theory Orthogonal arrays Orthogonality Statistics Stratification Systems Theory |
Title | Group Strong Orthogonal Arrays with Appealing Two-Dimensional Space-Filling Property |
URI | https://link.springer.com/article/10.1007/s11424-025-3567-z https://www.proquest.com/docview/3227041474 |
Volume | 38 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED1Bu5QBQQFRKJUHJpClfNiJM1bQgkB8SG2lMkVO4hSWBiVBqP31nPNBAMHAGCW64Tlnv3f2PQOc2kyaIQoHKsxQUhYpTj3uYrpH3IslMgojKtw-753rGbuZ83nVx53Vp93rLclipm6a3XRTFtXXr9ocs3u9CW2upTv-xDNrWE-_Nsq9sv_N8FAXWazeyvwtxPfFqGGYPzZFi7VmvAPbFUkkw3JUd2FDLbuw9cU6EJ_uPv1Wsy50NGcsLZf3YFrUk8hEF7kX5CHNn5NFUsZL5SojuvRKkH0iRcRQZPqe0Evt8V_6c5AJqmhFxy-FWTd51MX6NF_tw2w8ml5c0-ryBBparpFT5jkickWEfNTyIo9h6krb1IRHYeIpFiFMoeCxZwWmCGImjViEEsVdEDp2wJR9AK1lslSHQLRlvmEL5D4oPgQyKubwoLhs1OPSCN0enNUo-q-lR4bfuCFryH2E3NeQ--se9Guc_SpdMh9nFddgJnNZD85r7JvXfwY7-tfXx9Cx9NgXx_f60MrTN3WClCIPBtAeXj3djgbFr_QBB1vCyA |
linkProvider | Springer Nature |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED5BGYABQQFRKOCBCWQpDztxxgqoCrQFqanUzcqzsDQoCULtr-ecBwEEA2OU6IYvPvu712eAC5N5eoCBAxV64FEWRpw63EZ3D7kTe8gotLBQ-xxbgym7n_FZNced1d3udUmy2KmbYTc1lEXV9asmR-9ercMGcgGh-rimRq_efk0M98r5N83BuMhgdSnzNxPfD6OGYf4oihZnTX8XdiqSSHrlX92DtWjRhu0v0oH4NPrUW83asKU4Yym5vA9ukU8iE5XknpPHNH9O5klpL_WWGVGpV4LsEykimiLue0JvlMZ_qc9BJhhFR7T_Uoh1kyeVrE_z5QFM-7fu9YBWlyfQwLC1nDLHEqEtQuSjhhM6DF3XM3VFeCJ0vIiFCFMgeOwYvi78mHlaLAIPgzs_sEyfReYhtBbJIjoCoiTzNVMg98HgQyCjYhb3i8tGHe5pgd2ByxpF-VpqZMhGDVlBLhFyqSCXqw50a5xl5S6ZxF3F1pjObNaBqxr75vWfxo7_9fU5bA7c0VAO78YPJ7BlqHVQtPJ1oZWnb9Ep0ovcPyuW0wc7i8Qn |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60gtSDaFWsVt2DJ2VpHrt5HIs11FcttIXeQpJNqpekpBFpf72zeRgVPXgMCXP4sjP7zezONwCXOvPUABMHaqmBR5kIObW5ie4uuB15yCgUkat9Do3BlN3P-Kycc7qsbrtXR5JFT4NUaYqz7kJE3brxTTZoUTmKVefo6etN2MJorMplPdV6VSjWMfUreuEUG3MkjVXHmr-Z-L4x1WzzxwFpvu84e7BbEkbSK_7wPmyEcQt2vsgI4tPTp_bqsgVNyR8L-eUDmOS1JTKWBe85eU6zl2SeFPZSb7UksgxLkIkiXURTZPKe0L7U-y-0OsgYM-qQOq-5cDcZycJ9mq0OYercTm4GtBykQAPNVDLKbMMSpiWQm2q2sBm6saerkvyE6IQhEwhTYPHI1nzV8iPmKZEVeJjo-YGh-yzUj6ARJ3F4DETK5yu6hTwIExEL2RUzuJ8PHrW5pwRmG64qFN1FoZfh1srIEnIXIXcl5O66DZ0KZ7d0naWLEcZUmMpM1obrCvv69Z_GTv719QVsj_qO-3g3fDiFpiaXQX6rrwONLH0Lz5BpZP55vpo-AOWvyGM |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Group+Strong+Orthogonal+Arrays+with+Appealing+Two-Dimensional+Space-Filling+Property&rft.jtitle=Journal+of+systems+science+and+complexity&rft.au=Wang%2C+Chunyan&rft.au=Yang%2C+Jinyu&rft.date=2025-08-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=1009-6124&rft.eissn=1559-7067&rft.volume=38&rft.issue=4&rft.spage=1747&rft.epage=1765&rft_id=info:doi/10.1007%2Fs11424-025-3567-z&rft.externalDocID=10_1007_s11424_025_3567_z |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1009-6124&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1009-6124&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1009-6124&client=summon |